Sciweavers

3864 search results - page 569 / 773
» time 2005
Sort
View
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
15 years 10 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
APWEB
2005
Springer
15 years 10 months ago
Automatic Runtime Validation and Correction of the Navigational Design of Web Sites
Abstract. Essential to an audience driven website design philosophy is the organization of information and functionality according to the requirements of the different audience cla...
Sven Casteleyn, Irene Garrigós, Olga De Tro...
APWEB
2005
Springer
15 years 10 months ago
An LOD Model for Graph Visualization and Its Application in Web Navigation
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
Shixia Liu, Yue Pan, Liping Yang, Wenyin Liu
ATAL
2005
Springer
15 years 10 months ago
Controlling teams of uninhabited air vehicles
We describe a Multi-Agent System (MAS) for controlling teams of uninhabited air vehicles (UAVs) in the context of a larger system that has been used to evaluate potential concepts...
Jeremy W. Baxter, Graham S. Horn
ATAL
2005
Springer
15 years 10 months ago
Negotiating over small bundles of resources
When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socia...
Yann Chevaleyre, Ulle Endriss, Jérôme...