Sciweavers

807 search results - page 14 / 162
» Competition Adds Complexity
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Strategic betting for competitive agents
In many multiagent settings, each agent's goal is to come out ahead of the other agents on some metric, such as the currency obtained by the agent. In such settings, it is no...
Liad Wagman, Vincent Conitzer
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 1 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
IWQOS
2001
Springer
13 years 12 months ago
On Creating Proportional Loss-Rate Differentiation: Predictability and Performance
— Recent extensions to the Internet architecture allow assignment of different levels of drop precedence to IP packets. This paper examines differentiation predictability and imp...
Ulf Bodin, Andreas Jonsson, Olov Schelén
ENTCS
2006
112views more  ENTCS 2006»
13 years 7 months ago
Interface Automata with Complex Actions
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
Shahram Esmaeilsabzali, Farhad Mavaddat, Nancy A. ...
MOC
1998
71views more  MOC 1998»
13 years 7 months ago
Factorizing complex symmetric matrices with positive definite real and imaginary parts
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...
Nicholas J. Higham