9842 search results - page 337 / 1969 » Problem complexity |
205
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
177
click to vote
TCS
1998
15 years 6 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
212
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
330
click to vote
PADL
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. PADS is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data ...
163
click to vote
ISAAC
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...