Sciweavers

2266 search results - page 340 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
114
Voted
ECSQARU
2009
Springer
15 years 10 months ago
Local Computation Schemes with Partially Ordered Preferences
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
Hélène Fargier, Nic Wilson
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
13 years 6 months ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
15 years 9 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
GECCO
2004
Springer
15 years 9 months ago
Improving Generalisation Performance Through Multiobjective Parsimony Enforcement
This paper describes POPE-GP, a system that makes use of the NSGA-II multiobjective evolutionary algorithm as an alternative, parameter-free technique for eliminating program bloat...
Yaniv Bernstein, Xiaodong Li, Victor Ciesielski, A...
ECCV
2002
Springer
16 years 5 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára