520 search results - page 84 / 104 » New Complexity Results for Classical Planning Benchmarks |
PAM
2010
Springer
14 years 2 months ago
2010
Springer
The ability to pinpoint the geographic location of IP hosts is compelling for applications such as on-line advertising and network attack diagnosis. While prior methods can accurat...
PPOPP
2005
ACM
14 years 27 days ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
CONSTRAINTS
2011
13 years 2 months ago
2011
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Modern interactive computer games provide the ability to objectively record complex human behavior, offering a variety of interesting challenges to the pattern-recognition communi...