335 search results - page 51 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
CSL
2003
Springer
14 years 19 days ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
VLSID
2002
IEEE
14 years 7 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
AI
2011
Springer
13 years 2 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
CW
2008
IEEE
14 years 1 months ago
2008
IEEE
Traveling through immersive virtual environments (IVEs) by means of real walking is an important activity to increase naturalness of VR-based interaction. However, the size of the...