Sciweavers

664 search results - page 47 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
ATAL
2003
Springer
15 years 3 months ago
Multiagent diffusion and distributed optimization
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Kwok Ching Tsui, Jiming Liu
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
15 years 4 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
15 years 3 months ago
Dynamic optimization of migration topology in internet-based distributed genetic algorithms
Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a maj...
Johan Berntsson, Maolin Tang
DOLAP
2007
ACM
15 years 1 months ago
Deciding the physical implementation of ETL workflows
In this paper, we deal with the problem of determining the best possible physical implementation of an ETL workflow, given its logical-level description and an appropriate cost mo...
Vasiliki Tziovara, Panos Vassiliadis, Alkis Simits...
MFCS
2010
Springer
14 years 8 months ago
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
Kenya Ueno