Sciweavers

1158 search results - page 82 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
ATAL
2005
Springer
15 years 11 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni
INFOCOM
2003
IEEE
15 years 11 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
15 years 6 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
EOR
2002
105views more  EOR 2002»
15 years 5 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
FUIN
2006
98views more  FUIN 2006»
15 years 6 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson