10988 search results - page 1714 / 2198 » Algorithmic Folding Complexity |
196
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
193
click to vote
IJIS
2002
15 years 6 months ago
2002
ior-based robots, planning is necessary to elaborate abstract plans that resolve complex navigational tasks. Usually maps of the environment are used to plan the robot motion and t...
177
click to vote
EXPERT
1998
15 years 6 months ago
1998
This article illustrates the complexities of real-world planning and how we can create AI planning systems to address them. We describe the IMACS Project (Interactive Manufacturab...
228
Voted
INFORMS
1998
15 years 6 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
243
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...