Sciweavers

284 search results - page 16 / 57
» On Some Polyhedra Covering Problems
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 10 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
ICSE
2007
IEEE-ACM
14 years 3 months ago
Aspect-Oriented Design in Java/AspectJ and Ruby
This tutorial teaches professional developers design principles for “production-quality”, aspect-oriented software, written in Java/AspectJ and Ruby. The discussion starts wit...
Dean Wampler
PDCN
2004
13 years 10 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
COMPSAC
2006
IEEE
14 years 2 months ago
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
Jun Yan, Jian Zhang
SIROCCO
2004
13 years 10 months ago
Existence of Nash Equilibria in Selfish Routing Problems
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
Alessandro Ferrante, Mimmo Parente