7421 search results - page 259 / 1485 » In search of dependable design |
169
click to vote
DGO
2003
15 years 8 months ago
2003
Connected Kids project is about developing a searchable database system for the disenfranchised people of the city of Troy, New York. The various events and programs for the young...
246
click to vote
IJCAI
2003
15 years 8 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
160
click to vote
CLEF
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We design and validate simulators for generating queries and relevance judgments for retrieval system evaluation. We develop a simulation framework that incorporates exis...
180
click to vote
ENTCS
2002
15 years 6 months ago
2002
Declarative debugging has been proposed as a suitable technique for developing debuggers in the context of declarative languages. However, to become really useful debuggers must b...
193
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...