Sciweavers

782 search results - page 120 / 157
» A Modular Algorithm for Resource Allocation
Sort
View
JAIR
2006
102views more  JAIR 2006»
13 years 8 months ago
Multiple-Goal Heuristic Search
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
Dmitry Davidov, Shaul Markovitch
AAAI
2007
13 years 10 months ago
Concurrent Action Execution with Shared Fluents
Concurrent action execution is important for plan-length minimization. However, action specifications are often limited to avoid conflicts arising from precondition/effect inter...
Michael Buro, Alexander Kovarsky
ANCS
2005
ACM
14 years 1 months ago
A novel reconfigurable hardware architecture for IP address lookup
IP address lookup is one of the most challenging problems of Internet routers. In this paper, an IP lookup rate of 263 Mlps (Million lookups per second) is achieved using a novel ...
Hamid Fadishei, Morteza Saheb Zamani, Masoud Sabae...
INFOCOM
2010
IEEE
13 years 6 months ago
Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles
—We consider the problem of ’fair’ scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking d...
Veeraruna Kavitha, Eitan Altman, Rachid El Azouzi,...
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 2 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi