Sciweavers

5864 search results - page 295 / 1173
» Can We Work around Numerical Methods
Sort
View
PROCEDIA
2011
14 years 10 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
200
Voted
IPPS
2008
IEEE
16 years 1 months ago
Reducing wasted resources to help achieve green data centers
In this paper we introduce a new approach to the consolidation strategy of a data center that allows an important reduction in the amount of active nodes required to process a het...
Jordi Torres, David Carrera, Kevin Hogan, Ricard G...
CEAS
2004
Springer
16 years 24 days ago
Word Stemming to Enhance Spam Filtering
Generally a content based spam filter works on words and phrases of email text and if it finds offensive content it gives that email a numerical value (depending on the content). A...
Shabbir Ahmed, Farzana Mithun
199
Voted
EOR
2006
106views more  EOR 2006»
15 years 7 months ago
Optimal dynamic assignment of a flexible worker on an open production line with specialists
This paper models and analyzes serial production lines with specialists at each station and a single, cross-trained floating worker who can work at any station. We formulate Marko...
Linn I. Sennott, Mark P. Van Oyen, Seyed M. R. Ira...
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
16 years 2 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...