8413 search results - page 405 / 1683 » Ordering Problem Subgoals |
172
click to vote
RTAS
2008
IEEE
16 years 1 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
153
click to vote
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
156
click to vote
ATAL
2007
Springer
16 years 26 days ago
2007
Springer
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
155
click to vote
ICB
2007
Springer
16 years 26 days ago
2007
Springer
The problems that arise in forensic document examination, are usually quite different from that of traditional writer identification and verification tasks, where the data is ass...
170
click to vote
SAT
2007
Springer
16 years 24 days ago
2007
Springer
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...