1568 search results - page 27 / 314 » The problem of examination questions in algorithmics |
PVM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— Classical path planning does not address many of the challenges of robotic systems subject to differential constraints. While there have been many recent efforts to develop mot...
AAAI
2008
15 years 10 days 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...
WABI
2005
Springer
15 years 3 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
ICMCS
2007
IEEE
15 years 4 months ago
2007
IEEE
Due to the increase in diversity of wireless devices, streaming media systems must be capable of serving multiple types of users. Scalable coding allows for adaptations without re...