Sciweavers

350 search results - page 65 / 70
» Soft Linear Set Theory
Sort
View
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
15 years 9 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
INFOCOM
2009
IEEE
15 years 4 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
ATAL
2009
Springer
15 years 4 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
CIKM
2007
Springer
15 years 3 months ago
Improving the classification of newsgroup messages through social network analysis
Newsgroup participants interact with their communities through conversation threads. They may respond to a message to answer a question, debate a topic, support or disagree with a...
Blaz Fortuna, Eduarda Mendes Rodrigues, Natasa Mil...
126
Voted
SENSYS
2006
ACM
15 years 3 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...