Sciweavers

1662 search results - page 103 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SIP
2003
13 years 10 months ago
Design of Full Band IIR Digital Differentiators
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...
Xi Zhang, Toshinori Yoshikawa
ATAL
2010
Springer
13 years 10 months ago
Strategy-proof allocation of multiple items between two agents without payments or priors
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
Mingyu Guo, Vincent Conitzer
MOBIHOC
2008
ACM
14 years 8 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
AI
2000
Springer
13 years 8 months ago
On agent-based software engineering
Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly impro...
Nicholas R. Jennings
VRST
2009
ACM
14 years 3 months ago
A semantic environment model for crowd simulation in multilayered complex environment
Simulating crowds in complex environment is fascinating and challenging, however, modeling of the environment is always neglected in the past, which is one of the essential proble...
Hao Jiang, Wenbin Xu, Tianlu Mao, Chunpeng Li, Shi...