Sciweavers

13603 search results - page 220 / 2721
» On the Complexity of Computing Treelength
Sort
View
STACS
2007
Springer
15 years 10 months ago
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
Felix Brandt, Felix A. Fischer, Markus Holzer
FSTTCS
2005
Springer
15 years 10 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
IPPS
2002
IEEE
15 years 9 months ago
A Framework for Using Benefit Functions In Complex Real Time Systems
Researchers are currently investigating applying benefit, or utility functions for allocating resources in limited, soft real time systems [1,2,3]. While the future of real -time ...
David L. Andrews, Lonnie R. Welch, David M. Chelbe...
PG
2002
IEEE
15 years 9 months ago
Roadmap-Based Flocking for Complex Environments
Flocking behavior is very common in nature, and there have been ongoing research efforts to simulate such behavior in computer animations and robotics applications. Generally, suc...
O. Burçhan Bayazit, Jyh-Ming Lien, Nancy M....
WG
2001
Springer
15 years 9 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...