Sciweavers

4488 search results - page 221 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
ATAL
2008
Springer
15 years 6 months ago
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
William Yeoh, Ariel Felner, Sven Koenig
AAIP
2009
15 years 5 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson
ASPDAC
2005
ACM
119views Hardware» more  ASPDAC 2005»
15 years 6 months ago
CMP aware shuttle mask floorplanning
- By putting different chips on the same mask, shuttle mask (or multiple project wafer) provides an economical solution for low volume designs and design prototypes to share the ri...
Gang Xu, Ruiqi Tian, David Z. Pan, Martin D. F. Wo...
SIGSOFT
2007
ACM
16 years 4 months ago
The impact of input domain reduction on search-based test data generation
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil...
ADHOC
2007
101views more  ADHOC 2007»
15 years 4 months ago
Searching strategies for target discovery in wireless networks
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
Zhao Cheng, Wendi B. Heinzelman