Sciweavers

6253 search results - page 1177 / 1251
» Use Case Modeling Guidelines
Sort
View
129
Voted
TPHOL
2007
IEEE
15 years 9 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison
114
Voted
COCOON
2007
Springer
15 years 9 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
143
Voted
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
15 years 9 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
INFOCOM
2005
IEEE
15 years 9 months ago
Joint optimal scheduling and routing for maximum network throughput
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
« Prev « First page 1177 / 1251 Last » Next »