1516 search results - page 226 / 304 » The Increasing Nvalue Constraint |
133
click to vote
IJCAI
2001
15 years 5 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
136
click to vote
NETWORKING
2004
15 years 5 months ago
2004
This paper addresses bandwidth allocation for an integrated voice/data broadband mobile wireless network. Specifically, we propose a new admission control scheme called EFGC, whic...
139
click to vote
NETWORKING
2004
15 years 5 months ago
2004
We consider a system with multiple interconnected video servers storing TV programs that are received through satellite antennas. Users, equipped with set-top boxes, submit request...
150
click to vote
IJCAI
2003
15 years 5 months ago
2003
With the growing use of distributed information networks, there is an increasing need for algorithmic and system solutions for data-driven knowledge acquisition using distributed,...
152
click to vote
IJCAI
2003
15 years 5 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...