Sciweavers

169 search results - page 31 / 34
» arc 2007
Sort
View
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
13 years 11 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
FLAIRS
2007
13 years 7 months ago
Towards Player Preference Modeling for Drama Management in Interactive Stories
There is a growing interest in producing story based game experiences that do not follow fixed scripts predefined by the author, but change the experience based on actions perfo...
Manu Sharma, Santiago Ontañón, Chris...
WSC
2007
13 years 7 months ago
How to synthesize nets from languages: a survey
In this paper we present a survey on methods for the synthesis of Petri nets from behavioral descriptions given as languages. We consider place/transition Petri nets, elementary P...
Robert Lorenz, Sebastian Mauser, Gabriel Juh&aacut...
FAST
2007
13 years 7 months ago
Karma: Know-It-All Replacement for a Multilevel Cache
Multilevel caching, common in many storage configurations, introduces new challenges to traditional cache management: data must be kept in the appropriate cache and replication a...
Gala Yadgar, Michael Factor, Assaf Schuster
DISOPT
2008
91views more  DISOPT 2008»
13 years 5 months ago
Partition inequalities for capacitated survivable network design based on directed p-cycles
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
Alper Atamtürk, Deepak Rajan