We investigate the use of oblivious, read-once decision graphs as structures for representing concepts over discrete domains, and present a bottom-up, hill-climbing algorithm for inferring these structures from labelled instances. The algorithm is robust with respect to irrelevant attributes, and experimental results show that it performs well on problems considered di cult for symbolic inducti...

Many learning systems search through a space of possible performance elements, seeking an element with high expected utility. As the task of nding the globally optimal element is usually intractable, many practical learning systems use hill-climbing to nd a local optimum. Unfortunately, even this is diicult, as it depends on the distribution of problems, which is typically unknown. This paper a...

In this paper, we use a hill-climbing attack algorithm based on Bayesian adaption to test the vulnerability of two face recognition systems to indirect attacks. The attacking technique uses the scores provided by the matcher to adapt a global distribution computed from an independent set of users, to the local specificities of the client being attacked. The proposed attack is evaluated on an ei...

In this paper we present a greedy algorithm for solving the problem of the maximum partitioning of graphs with supply and demand (MPGSD). The goal of the method is to solve the MPGSD for large graphs in a reasonable time limit. This is done by using a two stage greedy algorithm, with two corresponding types of heuristics. The solutions acquired in this way are improved by applying a computation...

Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present CABOB, a sophisticated search algorithm for the problem. It uses decomposition techniques, upper and lower bounding (also across components), elaborate and dynamically chosen bid ordering heuristics, and a host of str...

In this paper, motivations are presented to argue in favor of the affixal status of Romanian pronominal clitics. It will be suggested that they should not be considered lexical items, i.e. ‘signs’, which are located in a special position by rules of syntax, but a complex of syntactic and semantic information which is provided in the lexicon for the morphophonological realization of the cliticiz...

Nowadays there are a huge number of applications produce the immense amount of data in the form of a data stream, which needs real time analysis. Sensor networks, real-time surveillance and telecommunication systems are the examples of such applications. The real time analysis of the data stream leads to a number of computational and mining challenges. In this scenario new data arrives continuo...

This paper examines the performance of hill-climbing algorithms on standard test problems for combinatorial auctions (CAs). On single-unit CAs, deterministic hill-climbers are found to perform well, and their performance can be improved signiicantly by randomizing them and restarting them several times, or by using them collectively. For some problems this good performance is shown to be no bet...

Wormhole routing is an attractive scheme for large mul-ticomputer networks. In this paper, we include several such representative schemes and make performance comparisons via simulation on an N N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in ...

Data routing is one of the most important problems in parallel networks. Long latency in low dimensional networks can be solved by including segmented reconngurable buses (SRB). In addition to physical limitation we choose the segment length such that we may get the best resource utilization and minimize the average latency. After choosing the segment length, we have to arrange these segments c...