2796 search results - page 482 / 560 » The coolest path problem |
148
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the...
139
click to vote
FMCAD
2008
Springer
15 years 6 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...
139
click to vote
FORMATS
2008
Springer
15 years 6 months ago
2008
Springer
We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the...
146
click to vote
COLOGNETWENTE
2008
15 years 6 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
148
click to vote
IWEC
2010
15 years 6 months ago
2010
In many computer games narrative is a core component with the game centering on an unfolding, interactive storyline which both motivates and is driven by the game-play. Analyzing n...