Sciweavers

7395 search results - page 1419 / 1479
» Social Modeling and i*
Sort
View
ADHOCNOW
2007
Springer
15 years 4 months ago
Topology Control and Geographic Routing in Realistic Wireless Networks
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pir...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 4 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
ATAL
2007
Springer
15 years 4 months ago
Extending character-based storytelling with awareness and feelings
Most Interactive Storytelling systems developed to date have followed a task-based approach to story representation, using planning techniques to drive the story by generating a s...
David Pizzi, Marc Cavazza, Jean-Luc Lugrin
ATAL
2007
Springer
15 years 4 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
ATAL
2007
Springer
15 years 4 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
« Prev « First page 1419 / 1479 Last » Next »