Sciweavers

492 search results - page 28 / 99
» The number of possibilities for random dating
Sort
View
AIPS
2009
13 years 9 months ago
Preferred Operators and Deferred Evaluation in Satisficing Planning
Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various...
Silvia Richter, Malte Helmert
CC
2010
Springer
117views System Software» more  CC 2010»
13 years 6 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
MABS
2000
Springer
14 years 6 days ago
Mapping the Envelope of Social Simulation Trajectories
Discovering and studying emergent phenomena are among the most important activities in social research. Replicating this phenomenon in "the lab" using simulation is an i...
Oswaldo Terán, Bruce Edmonds, Steve Wallis
DATE
2009
IEEE
125views Hardware» more  DATE 2009»
14 years 3 months ago
On linewidth-based yield analysis for nanometer lithography
— Lithographic variability and its impact on printability is a major concern in today’s semiconductor manufacturing process. To address sub-wavelength printability, a number of...
Aswin Sreedhar, Sandip Kundu
COLCOM
2009
IEEE
14 years 1 months ago
Square region-based coverage and connectivity probability model in wireless sensor networks
—Sensing coverage and network connectivity are two fundamental issues in wireless sensor networks (WSNs). Due to resource constraints of sensor nodes, it may not be possible, or ...
Xiaofei Xing, Guojun Wang, Jie Wu, Jie Li