Sciweavers

512 search results - page 53 / 103
» On Evolutionary Optimization of Large Problems Using Small P...
Sort
View
105
Voted
AAAI
2004
15 years 1 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
AAAI
1998
15 years 1 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
CVPR
2009
IEEE
16 years 7 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)
94
Voted
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 5 months ago
Studying the Advantages of a Messy Evolutionary Algorithm for Natural Language Tagging
The process of labeling each word in a sentence with one of its lexical categories (noun, verb, etc) is called tagging and is a key step in parsing and many other language processi...
Lourdes Araujo
128
Voted
WWW
2011
ACM
14 years 7 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg