8413 search results - page 330 / 1683 » Ordering Problem Subgoals |
177
click to vote
ACHI
2009
IEEE
15 years 11 months ago
2009
IEEE
Research on social robots is mainly comprised of research into algorithmic problems in order to expand a robot´s capabilities to improve communication with human beings. Also, a ...
176
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
144
click to vote
WLP
1997
Springer
15 years 10 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
134
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
Temporal correctness is crucial to the dependability of real-time systems. Few methods exist to test for temporal correctness and most existing methods are ad-hoc. A problem with ...
152
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...