Sciweavers

1208 search results - page 195 / 242
» Uniform eventown problems
Sort
View
113
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
15 years 9 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 4 months ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 3 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
79
Voted
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
15 years 3 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das