Sciweavers

2657 search results - page 332 / 532
» On the complexity of hierarchical problem solving
Sort
View
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
15 years 8 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...
AAIP
2009
15 years 8 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson
159
Voted
COR
2007
143views more  COR 2007»
15 years 6 months ago
Discrete bandwidth allocation considering fairness and transmission load in multicast networks
As a promising solution to tackle the network heterogeneity in multicasting, layered multicast protocols such as Receiver-driven layered multicast (RLM) and Layered video multicas...
Chae Y. Lee, Hee K. Cho
213
Voted
TCSV
2008
128views more  TCSV 2008»
15 years 6 months ago
Compression-Aware Energy Optimization for Video Decoding Systems With Passive Power
The objective of dynamic voltage scaling (DVS) is to adapt the frequency and voltage for configurable platforms to obtain energy savings. DVS is especially attractive for video dec...
Emrah Akyol, Mihaela van der Schaar
AI
2002
Springer
15 years 6 months ago
Multi-agent oriented constraint satisfaction
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional...
Jiming Liu, Han Jing, Yuan Yan Tang