Sciweavers

838 search results - page 23 / 168
» Finding Optimal Solutions to Atomix
Sort
View
ESWA
2010
175views more  ESWA 2010»
13 years 5 months ago
A multi-objective PSO for job-shop scheduling problems
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
D. Y. Sha, Hsing-Hung Lin
VLDB
1991
ACM
122views Database» more  VLDB 1991»
13 years 11 months ago
An Iterative Method for Distributed Database Design
The development of a distributed database systemrequires effective solutions to many complex and interrelated design problems. The cost dependenciesbetween query optimization and ...
Rex Blankinship, Alan R. Hevner, S. Bing Yao
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
14 years 1 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
ANOR
2004
79views more  ANOR 2004»
13 years 7 months ago
Preference-Based Search and Multi-Criteria Optimization
Many real-world AI problems (e.g. in configuration) are weakly constrained, thus requiring a mechanism for characterizing and finding the preferred solutions. Preferencebased sear...
Ulrich Junker
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 26 days ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins