Sciweavers

2949 search results - page 378 / 590
» Universal Sparse Modeling
Sort
View
IJCAI
1993
14 years 3 days ago
Provably Bounded Optimal Agents
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
Stuart J. Russell, Devika Subramanian, Ronald Parr
ADHOC
2010
292views more  ADHOC 2010»
13 years 11 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
MANSCI
2006
104views more  MANSCI 2006»
13 years 10 months ago
Procuring Fast Delivery: Sole Sourcing with Information Asymmetry
This paper studies a queuing model in which a buyer sources a good or service from an single supplier chosen from a pool of suppliers. The buyer seeks to minimize the sum of her p...
Gérard P. Cachon, Fuqiang Zhang
EC
1998
112views ECommerce» more  EC 1998»
13 years 10 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
MA
2010
Springer
153views Communications» more  MA 2010»
13 years 9 months ago
Testing quasi-independence for truncation data
Quasi-independence is a common assumption for analyzing truncated data. To verify this condition, we consider a class of weighted log-rank type statistics that include existing te...
Takeshi Emura, Weijing Wang