4110 search results - page 73 / 822 » Efficient algorithms for the 2-gathering problem |
121
Voted
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
142
click to vote
AAAI
2008
15 years 6 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
123
Voted
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another obj...
132
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
116
click to vote
TITS
2008
15 years 3 months ago
2008
Arrival sequencing and scheduling (ASS) at airports is an NP-hard problem. Much effort has been made to use permutation-representation-based genetic algorithms (GAs) to tackle this...