Sciweavers

1344 search results - page 147 / 269
» Problem Solving with Adaptive Feedback
Sort
View
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
14 years 2 months ago
Use of a genetic algorithm in brill's transformation-based part-of-speech tagger
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
Garnett Carl Wilson, Malcolm I. Heywood
PATAT
2004
Springer
150views Education» more  PATAT 2004»
14 years 2 months ago
Logistics Service Network Design for Time-Critical Delivery
Abstract. Service network design is critical to the profitability of express shipment carriers. In this paper, we consider the problem of designing the integrated service network ...
Cynthia Barnhart, Su Shen
ESEC
1999
Springer
14 years 1 months ago
The CIP Method: Component- and Model-Based Construction of Embedded Systems
CIP is a model-based software development method for embedded systems. The problem of constructing an embedded system is decomposed into a functional and a connection problem. The ...
Hugo Fierz
ECAI
2010
Springer
13 years 10 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 3 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl