Sciweavers

2379 search results - page 362 / 476
» Computer Science in the Information Age
Sort
View
FOCS
2000
IEEE
15 years 8 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
FOCS
1994
IEEE
15 years 8 months ago
The Load, Capacity and Availability of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
Moni Naor, Avishai Wool
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 8 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
CSR
2008
Springer
15 years 4 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
SIGCSE
2008
ACM
143views Education» more  SIGCSE 2008»
15 years 4 months ago
Test-driven learning in early programming courses
Coercing new programmers to adopt disciplined development practices such as thorough unit testing is a challenging endeavor. Test-driven development (TDD) has been proposed as a s...
David Janzen, Hossein Saiedian