Sciweavers

778 search results - page 9 / 156
» Improved universal denominators
Sort
View
SIROCCO
2004
13 years 8 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
CHI
2009
ACM
14 years 8 months ago
Jadeite: improving API documentation using usage information
Jadeite is a new Javadoc-like API documentation system that takes advantage of multiple users' aggregate experience to reduce difficulties that programmers have learning new ...
Jeffrey Stylos, Brad A. Myers, Zizhuang Yang
CP
2007
Springer
14 years 1 months ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
SIGMOD
2002
ACM
96views Database» more  SIGMOD 2002»
14 years 7 months ago
Toward Autonomic Computing with DB2 Universal Database
As the cost of both hardware and software falls due to technological advancements and economies of scale, the cost of ownership for database applications is increasingly dominated...
Sam Lightstone, Guy M. Lohman, Daniel C. Zilio
CLEF
2007
Springer
14 years 1 months ago
Charles University at CLEF 2007 Ad-Hoc Track
In this paper we describe retrieval experiments performed at Charles University in Prague for participation in the CLEF 2007 Ad-Hoc track. We focused on the Czech monolingual task...
Pavel Ceska, Pavel Pecina