Sciweavers

115 search results - page 20 / 23
» Bounds on the Number of Maximal Sum-Free Sets
Sort
View
JHSN
2007
165views more  JHSN 2007»
13 years 7 months ago
Slack allocation techniques for intra-path load balancing
: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end...
Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin
TON
1998
186views more  TON 1998»
13 years 7 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar
ML
2007
ACM
104views Machine Learning» more  ML 2007»
13 years 7 months ago
A general criterion and an algorithmic framework for learning in multi-agent systems
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
Rob Powers, Yoav Shoham, Thuc Vu
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 2 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...
ICASSP
2008
IEEE
14 years 2 months ago
Learning to satisfy
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
Frederic Thouin, Mark Coates, Brian Eriksson, Robe...