Sciweavers

1284 search results - page 160 / 257
» Connectivity in Bag Generation
Sort
View
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
15 years 11 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
DIS
2003
Springer
15 years 11 months ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
CIKM
2009
Springer
15 years 11 months ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009
ICRE
2000
IEEE
15 years 10 months ago
Requirements Documentation: Why a Formal Basis is Essential
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
David Lorge Parnas
ICALP
1998
Springer
15 years 10 months ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...