Sciweavers

4110 search results - page 225 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
AIPS
2000
15 years 8 months ago
Computing Global Strategies for Multi-Market Commodity Trading
Thefocus of this workis the computationof efficient strategies for commoditytrading in a multi-marketenvironment. In today's "global economy"commodities are often b...
Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochanta...
ECAI
2004
Springer
15 years 10 months ago
Many Hands Make Light Work: Localized Satisfiability for Multi-Context Systems
In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, w...
Floris Roelofsen, Luciano Serafini, Alessandro Cim...
COR
2006
91views more  COR 2006»
15 years 6 months ago
An LP approach to compute the pre-kernel for cooperative games
We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
Holger Meinhardt
SIAMCO
2002
121views more  SIAMCO 2002»
15 years 6 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
ISCI
2008
159views more  ISCI 2008»
15 years 6 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao