Sciweavers

1012 search results - page 26 / 203
» Segment intersection searching problems in general settings
Sort
View
CEC
2010
IEEE
14 years 8 months ago
Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
Rammohan Mallipeddi, Ponnuthurai Nagaratnam Sugant...
PATAT
2004
Springer
151views Education» more  PATAT 2004»
15 years 5 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
AUSAI
2004
Springer
15 years 5 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
SIAMSC
2008
147views more  SIAMSC 2008»
14 years 11 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
CHI
2011
ACM
14 years 3 months ago
No clicks, no problem: using cursor movements to understand and improve search
Understanding how people interact with search engines is important in improving search quality. Web search engines typically analyze queries and clicked results, but these actions...
Jeff Huang, Ryen W. White, Susan T. Dumais