Sciweavers

2109 search results - page 291 / 422
» Solving Necklace Constraint Problems
Sort
View
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
15 years 6 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
EOR
2006
70views more  EOR 2006»
15 years 6 months ago
Search allocation game
This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...
Ryusuke Hohzaki
TR
2008
117views more  TR 2008»
15 years 6 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
JNW
2007
112views more  JNW 2007»
15 years 6 months ago
A Multi-Commodity Flow Model for Optimal Routing in Wireless MESH Networks
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
Antonio Capone, Fabio Martignon
CP
2008
Springer
15 years 7 months ago
Search Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
Helmut Simonis, Barry O'Sullivan