Sciweavers

6202 search results - page 88 / 1241
» Without Loss of Generality
Sort
View
103
Voted
CIE
2007
Springer
15 years 4 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
112
Voted
CORR
2004
Springer
124views Education» more  CORR 2004»
14 years 10 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
INFOCOM
2005
IEEE
15 years 3 months ago
Buffer sizing for congested Internet links
— Packet buffers in router/switch interfaces constitute a central element of packet networks. The appropriate sizing of these buffers is an important and open research problem. M...
Amogh Dhamdhere, Hao Jiang, Constantinos Dovrolis
73
Voted
SOSP
2003
ACM
15 years 7 months ago
Samsara: honor among thieves in peer-to-peer storage
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...
Landon P. Cox, Brian D. Noble
MOBISYS
2010
ACM
15 years 15 days ago
On the limits of effective hybrid micro-energy harvesting on mobile CRFID sensors
Mobile sensing is difficult without power. Emerging Computational RFIDs (CRFIDs) provide both sensing and generalpurpose computation without batteries--instead relying on small ca...
Jeremy Gummeson, Shane S. Clark, Kevin Fu, Deepak ...