Sciweavers

672 search results - page 113 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
HEURISTICS
2000
127views more  HEURISTICS 2000»
13 years 8 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett
COMSWARE
2007
IEEE
14 years 3 months ago
OASiS: A Programming Framework for Service-Oriented Sensor Networks
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...
Manish Kushwaha, Isaac Amundson, Xenofon D. Koutso...
PAMI
2008
198views more  PAMI 2008»
13 years 8 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
TEC
2010
112views more  TEC 2010»
13 years 3 months ago
Population-Based Algorithm Portfolios for Numerical Optimization
In this paper, we consider the scenario that a population-based algorithm is applied to a numerical optimization problem and a solution needs to be presented within a given time bu...
Fei Peng, Ke Tang, Guoliang Chen, Xin Yao
PPSN
2010
Springer
13 years 7 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