Sciweavers

418 search results - page 70 / 84
» A relaxation-based algorithm for solving the conditional p-c...
Sort
View
AIPS
2009
13 years 8 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
13 years 11 months ago
Support vector regression for classifier prediction
In this paper we introduce XCSF with support vector prediction: the problem of learning the prediction function is solved as a support vector regression problem and each classifie...
Daniele Loiacono, Andrea Marelli, Pier Luca Lanzi
MOBIHOC
2007
ACM
14 years 7 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
ICS
2010
Tsinghua U.
14 years 10 days ago
Streamlining GPU applications on the fly: thread divergence elimination through runtime thread-data remapping
Because of their tremendous computing power and remarkable cost efficiency, GPUs (graphic processing unit) have quickly emerged as an influential computing platform for a broad ...
Eddy Z. Zhang, Yunlian Jiang, Ziyu Guo, Xipeng She...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
Susan Khor