520 search results - page 84 / 104 » New Complexity Results for Classical Planning Benchmarks |
101
Voted
PAM
2010
Springer
15 years 7 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...
101
Voted
PPOPP
2005
ACM
15 years 6 months 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...
117
click to vote
DAC
1994
ACM
15 years 4 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...
108
Voted
CONSTRAINTS
2011
14 years 7 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...
118
Voted
ICPR
2006
IEEE
16 years 1 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...