Sciweavers

1193 search results - page 195 / 239
» A primer of simple theories
Sort
View
SPAA
2003
ACM
15 years 5 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
SCALESPACE
2001
Springer
15 years 4 months ago
Scale-Time Kernels and Models
Receptive field sensitivity profiles of visual front-end cells in the LGN and V1 area in intact animals can be measured with increasing accuracy, both in the spatial and temporal...
Bart M. ter Haar Romeny, Luc Florack, Mads Nielsen
ICRE
2000
IEEE
15 years 4 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
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 4 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...