Sciweavers

400 search results - page 43 / 80
» Hard Problem Generation for MKP
Sort
View
116
Voted
VISSYM
2004
15 years 2 months ago
Shape-Embedded-Histograms for Visual Data Mining
Scatterplots are widely used in exploratory data analysis and class visualization. The advantages of scatterplots are that they are easy to understand and allow the user to draw c...
Amihood Amir, Reuven Kashi, Daniel A. Keim, Nathan...
100
Voted
AAAI
1998
15 years 2 months ago
Highest Utility First Search Across Multiple Levels of Stochastic Design
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...
104
Voted
RAS
2002
129views more  RAS 2002»
15 years 12 days ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
126
Voted
PPSN
2010
Springer
14 years 11 months ago
Towards Analyzing Recombination Operators in Evolutionary Search
Recombination (also called crossover) operators are widely used in EAs to generate offspring solutions. Although the usefulness of recombination has been well recognized, theoretic...
Yang Yu, Chao Qian, Zhi-Hua Zhou
122
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang