2487 search results - page 280 / 498 » Partitions of Graphs into Trees |
107
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
131
click to vote
ICRA
2002
IEEE
15 years 8 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
127
Voted
OPODIS
2008
15 years 5 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
138
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
138
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...