Sciweavers

1983 search results - page 271 / 397
» Competitive graph searches
Sort
View
WINE
2005
Springer
122views Economy» more  WINE 2005»
14 years 1 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
FCCM
2009
IEEE
134views VLSI» more  FCCM 2009»
14 years 7 days ago
Efficient Mapping of Hardware Tasks on Reconfigurable Computers Using Libraries of Architecture Variants
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
Miaoqing Huang, Vikram K. Narayana, Tarek A. El-Gh...
AAAI
2008
13 years 10 months ago
On-Line Case-Based Plan Adaptation for Real-Time Strategy Games
Traditional artificial intelligence techniques do not perform well in applications such as real-time strategy games because of the extensive search spaces which need to be explore...
Neha Sugandh, Santiago Ontañón, Ashw...
CIKM
2008
Springer
13 years 10 months ago
Error-driven generalist+experts (edge): a multi-stage ensemble framework for text categorization
We introduce a multi-stage ensemble framework, ErrorDriven Generalist+Expert or Edge, for improved classification on large-scale text categorization problems. Edge first trains a ...
Jian Huang 0002, Omid Madani, C. Lee Giles
EWCBR
2008
Springer
13 years 10 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...