Sciweavers

4335 search results - page 202 / 867
» Privatizing Constraint Optimization
Sort
View
RIVF
2003
15 years 7 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
AI
2008
Springer
15 years 6 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
SPAA
2009
ACM
16 years 3 months ago
Brief announcement: low depth cache-oblivious sorting
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardha...
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
16 years 3 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
ICDCS
2006
IEEE
16 years 16 days ago
On the Access Pricing Issues of Wireless Mesh Networks
This paper studies the use of pricing as an incentive mechanism to encourage private, self-interested nodes to participate in a public wireless mesh network and cooperate in the p...
Ray K. Lam, John C. S. Lui, Dah-Ming Chiu