Sciweavers

1026 search results - page 162 / 206
» An Optimal Solution to Room Search Problem
Sort
View
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
14 years 1 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
LCPC
1997
Springer
13 years 11 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
EDBT
2008
ACM
161views Database» more  EDBT 2008»
14 years 7 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
CANDC
2011
ACM
12 years 7 months ago
Understanding exploratory creativity in a visual domain
This paper describes a computerized aesthetic composition task that is based on a “creativity as search” metaphor. The technique collects detailed, moment-to-moment data about...
Kyle E. Jennings, Dean Keith Simonton, Stephen E. ...