Sciweavers

5316 search results - page 241 / 1064
» Which Search Problems Are Random
Sort
View
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
15 years 10 months ago
Automated Extraction of Problem Structure
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
Anthony Bucci, Jordan B. Pollack, Edwin D. de Jong
149
Voted
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 9 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
CVPR
2006
IEEE
16 years 6 months ago
Hidden Conditional Random Fields for Gesture Recognition
We introduce a discriminative hidden-state approach for the recognition of human gestures. Gesture sequences often have a complex underlying structure, and models that can incorpo...
Sy Bor Wang, Ariadna Quattoni, Louis-Philippe More...
147
Voted
AAAI
2000
15 years 6 months ago
TCBB Scheme: Applications to Single Machine Job Sequencing Problems
Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...
Sakib A. Mondal, Anup K. Sen
SAC
2009
ACM
15 years 11 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...