4378 search results - page 286 / 876 » On the Complexity of Ordered Colourings |
178
click to vote
CAMP
2005
IEEE
16 years 10 days ago
2005
IEEE
Abstract— The promise of next-generation computer technologies, such as nano-electronics, implies a number of serious alterations to the design flow of digital circuits. One of ...
194
click to vote
ATAL
2005
Springer
16 years 7 days ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
174
click to vote
ICN
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
178
click to vote
SARA
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
161
click to vote
SEMWEB
2005
Springer
16 years 5 days ago
2005
Springer
Recommender algorithms have been quite successfully employed in a variety of scenarios from filtering applications to recommendations of movies and books at Amazon.com. However, a...