Sciweavers

1380 search results - page 248 / 276
» Computing the optimal strategy to commit to
Sort
View
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 15 days ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
14 years 5 days ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
ICAI
2004
13 years 9 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 9 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
CLUSTER
2006
IEEE
14 years 2 months ago
Designing High Performance and Scalable MPI Intra-node Communication Support for Clusters
As new processor and memory architectures advance, clusters start to be built from larger SMP systems, which makes MPI intra-node communication a critical issue in high performanc...
Lei Chai, Albert Hartono, Dhabaleswar K. Panda