Sciweavers

1208 search results - page 37 / 242
» Uniform eventown problems
Sort
View
SCL
2010
86views more  SCL 2010»
14 years 10 months ago
Feedback boundary stabilization of wave equations with interior delay
Abstract. In this paper we consider a boundary stabilization problem for the wave equation with interior delay. We prove an exponential stability result under some Lions geometric ...
Kais Ammari, Serge Nicaise, Cristina Pignotti
114
Voted
MFCS
2005
Springer
15 years 5 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 5 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
COR
2006
140views more  COR 2006»
14 years 11 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
STACS
2005
Springer
15 years 5 months ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek