Sciweavers

1359 search results - page 161 / 272
» Black-Box Program Specialization
Sort
View
JSA
2008
124views more  JSA 2008»
13 years 10 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ENGL
2007
101views more  ENGL 2007»
13 years 10 months ago
Fault Tolerant Multi-Agent Systems: its communication and cooperation
— Intelligent Agents have originated a lot of discussion about what they are, and how they are different from general programs. We describe in this paper a new paradigm for intel...
Arnulfo Alanis Garza, Juan José Serrano, Ra...
EOR
2007
113views more  EOR 2007»
13 years 10 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas
ORL
2008
77views more  ORL 2008»
13 years 10 months ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...
SIAMJO
2008
97views more  SIAMJO 2008»
13 years 10 months ago
New Formulations for Optimization under Stochastic Dominance Constraints
Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically domina...
James Luedtke