Sciweavers

1562 search results - page 178 / 313
» Convenience Over Correctness
Sort
View
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 3 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
CD
2005
Springer
15 years 3 months ago
Modelling Deployment Using Feature Descriptions and State Models for Component-Based Software Product Families
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...
Slinger Jansen, Sjaak Brinkkemper
IPTPS
2005
Springer
15 years 3 months 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...
ATAL
2004
Springer
15 years 3 months ago
A Combinatorial Auction Protocol among Versatile Experts and Amateurs
Auctions have become an integral part of electronic commerce and a promising field for applying multi-agent technologies. Correctly judging the quality of auctioned items is ofte...
Takayuki Ito, Makoto Yokoo, Shigeo Matsubara
OOPSLA
2004
Springer
15 years 3 months ago
Finding and preventing run-time error handling mistakes
It is difficult to write programs that behave correctly in the presence of run-time errors. Existing programming language features often provide poor support for executing clean-u...
Westley Weimer, George C. Necula