Sciweavers

807 search results - page 38 / 162
» Competition Adds Complexity
Sort
View
OOPSLA
2009
Springer
15 years 4 months ago
Optimizing programs with intended semantics
Modern object-oriented languages have complex features that cause programmers to overspecify their programs. This overspecification hinders automatic optimizers, since they must ...
Daniel von Dincklage, Amer Diwan
WECWIS
2009
IEEE
159views ECommerce» more  WECWIS 2009»
15 years 4 months ago
Semantic Web Service Composition Framework Based on Parallel Processing
The process of semantic web service composition arranges several web services into one composite service to realize complex workflows with an exploitation of semantics. This pape...
Peter Bartalos, Mária Bieliková
IJCNN
2007
IEEE
15 years 3 months ago
Search Strategies Guided by the Evidence for the Selection of Basis Functions in Regression
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
Ignacio Barrio, Enrique Romero, Lluís Belan...
ICGA
1997
103views Optimization» more  ICGA 1997»
14 years 11 months ago
Genetic Algorithm for Restrictive Channel Routing Problem
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...
HEURISTICS
2007
139views more  HEURISTICS 2007»
14 years 9 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf