Sciweavers

1723 search results - page 180 / 345
» Cycling in linear programming problems
Sort
View
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 11 months ago
Expressive negotiation over donations to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
Vincent Conitzer, Tuomas Sandholm
INFOCOM
2003
IEEE
15 years 11 months ago
Design of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks
—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
Wanjiun Liao
RTSS
2002
IEEE
15 years 11 months ago
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
Insik Shin, Insup Lee, Sang Lyul Min
ATAL
2006
Springer
15 years 10 months ago
A constraint optimization framework for fractured robot teams
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...
Mary Koes, Katia P. Sycara, Illah R. Nourbakhsh
JMLR
2006
150views more  JMLR 2006»
15 years 6 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian