Sciweavers

1040 search results - page 37 / 208
» Tools for modeling and solving search problems
Sort
View
WWW
2008
ACM
14 years 8 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy
CAD
2005
Springer
13 years 7 months ago
Drawing curves onto a cloud of points for point-based modelling
Point-based geometric models are gaining popularity in both the computer graphics and CAD fields. A related design/modelling problem is the focus of the reported research: drawing...
Phillip N. Azariadis, Nickolas S. Sapidis
EUROPAR
2009
Springer
14 years 2 months ago
Searching for Concurrent Design Patterns in Video Games
The transition to multicore architectures has dramatically underscored the necessity for parallelism in software. In particular, while new gaming consoles are by and large multicor...
Micah J. Best, Alexandra Fedorova, Ryan Dickie, An...
SIGSOFT
2007
ACM
14 years 8 months ago
The impact of input domain reduction on search-based test data generation
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil...
4OR
2008
79views more  4OR 2008»
13 years 7 months ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano