Sciweavers

16091 search results - page 341 / 3219
» Solving
Sort
View
AAAI
2010
15 years 8 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
EOR
2010
88views more  EOR 2010»
15 years 6 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
15 years 6 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
TON
2002
91views more  TON 2002»
15 years 6 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...