Sciweavers

2475 search results - page 321 / 495
» On the accuracy of language trees
Sort
View
ICML
1996
IEEE
14 years 9 months ago
Representing and Learning Quality-Improving Search Control Knowledge
Generating good, production-quality plans is an essential element in transforming planners from research tools into real-world applications, but one that has been frequently overl...
M. Alicia Pérez
CP
2009
Springer
14 years 8 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
ICALP
2009
Springer
14 years 8 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
ICALP
2009
Springer
14 years 8 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
LICS
2009
IEEE
14 years 2 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos