1447 search results - page 201 / 290 » Graphs and Path Equilibria |
134
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
159
click to vote
DIS
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
191
click to vote
WAOA
2005
Springer
15 years 12 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
155
click to vote
CGO
2003
IEEE
15 years 10 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
183
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...