Sciweavers

6142 search results - page 650 / 1229
» The Complexity of Partition Functions
Sort
View
ICDCS
1991
IEEE
15 years 10 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
FM
2008
Springer
152views Formal Methods» more  FM 2008»
15 years 8 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
NSDI
2010
15 years 8 months ago
The Architecture and Implementation of an Extensible Web Crawler
Many Web services operate their own Web crawlers to discover data of interest, despite the fact that largescale, timely crawling is complex, operationally intensive, and expensive...
Jonathan M. Hsieh, Steven D. Gribble, Henry M. Lev...
ICWN
2008
15 years 8 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
AAAI
1996
15 years 8 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf