1447 search results - page 74 / 290 » Graphs and Path Equilibria |
230
click to vote
GC
2011
Springer
14 years 11 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
111
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
138
click to vote
ISPASS
2006
IEEE
15 years 10 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
123
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
158
click to vote
AIPS
2010
15 years 5 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...