Sciweavers

1844 search results - page 246 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 5 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
EDBT
2009
ACM
144views Database» more  EDBT 2009»
15 years 8 months ago
Efficient maintenance techniques for views over active documents
Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when moni...
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
AIPS
2009
15 years 5 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
TACAS
2009
Springer
122views Algorithms» more  TACAS 2009»
15 years 11 months ago
Test Input Generation for Programs with Pointers
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...
Dries Vanoverberghe, Nikolai Tillmann, Frank Piess...
ECAI
2004
Springer
15 years 10 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano