Sciweavers

17329 search results - page 3018 / 3466
» Improved non-approximability results
Sort
View
IPTPS
2005
Springer
16 years 15 days ago
Arpeggio: Metadata Searching and Content Sharing with Chord
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
Austin T. Clements, Dan R. K. Ports, David R. Karg...
ITICSE
2004
ACM
16 years 13 days ago
What do we mean by theoretically sound research in computer science education?
With our interest to improve our education in computer science, an understanding of how students learn about CS concepts, how different concepts are understood, as well as the con...
Mordechai Ben-Ari, Anders Berglund, Shirley Booth,...
MSWIM
2004
ACM
16 years 13 days ago
Scalable simulation of large-scale wireless networks with bounded inaccuracies
Discrete event network simulators have emerged as popular tools for verification and performance evaluation for various wireless networks. Nevertheless, the desire to model such ...
Zhengrong Ji, Junlan Zhou, Mineo Takai, Rajive Bag...
ADC
2004
Springer
105views Database» more  ADC 2004»
16 years 12 days ago
Do Clarity Scores for Queries Correlate with User Performance?
Recently the concept of a clarity score was introduced in order to measure the ambiguity of a query in relation to the collection in which the query issuer is seeking information ...
Andrew Turpin, William R. Hersh
AMAI
2004
Springer
16 years 12 days ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
« Prev « First page 3018 / 3466 Last » Next »