3113 search results - page 253 / 623 » Efficiently Generating Efficient Generating Extensions in Pr... |
114
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
141
click to vote
ICDM
2009
IEEE
15 years 2 months ago
2009
IEEE
Efficient acquisition of constraint networks is a key factor for the applicability of constraint problem solving methods. Current techniques ease knowledge acquisition by generati...
170
Voted
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
166
click to vote
AI
2010
Springer
15 years 5 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
185
click to vote
VIS
2009
IEEE
16 years 6 months ago
2009
IEEE
Abstract--In this paper we present a method for vortex core line extraction which operates directly on the smoothed particle hydrodynamics (SPH) representation and, by this, genera...