Sciweavers

3663 search results - page 87 / 733
» Problems in the ontology of computer programs
Sort
View
ICUMT
2009
14 years 7 months ago
Coping with variability of location sensing in large-scale ubicomp environments
The work addresses the problem of coping with a diversity of location tracking techniques available in ubiquitous computing environments. We investigate how this diversity can be e...
Petr Aksenov, Kris Luyten, Karin Coninx
IPCO
2004
93views Optimization» more  IPCO 2004»
14 years 11 months ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
ICALP
2007
Springer
15 years 4 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
CEC
2010
IEEE
14 years 11 months ago
Defining locality in genetic programming to predict performance
Abstract-- A key indicator of problem difficulty in evolutionary computation problems is the landscape's locality, that is whether the genotype-phenotype mapping preserves nei...
Edgar Galván López, James McDermott,...
IJCAI
2003
14 years 11 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf