805 search results - page 158 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
COLING
1996
13 years 9 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
COMCOM
2006
13 years 8 months ago
2006
Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities ...
SOSP
2003
ACM
14 years 5 months ago
2003
ACM
Peer-to-peer storage systems assume that their users consume resources in proportion to their contribution. Unfortunately, users are unlikely to do this without some enforcement m...
ISPD
2009
ACM
14 years 3 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
AAAI
2008
13 years 10 months ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...