Sciweavers

4716 search results - page 567 / 944
» Tangible functional programming
Sort
View
EOR
2010
219views more  EOR 2010»
14 years 11 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...
ENTCS
2006
114views more  ENTCS 2006»
14 years 11 months ago
Towards Efficient, Typed LR Parsers
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
François Pottier, Yann Régis-Gianas
TCS
2008
14 years 11 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
TNN
2008
81views more  TNN 2008»
14 years 11 months ago
Nonlinear Knowledge-Based Classification
Prior knowledge over general nonlinear sets is incorporated into nonlinear kernel classification problems as linear constraints in a linear program. The key tool in this incorpora...
Olvi L. Mangasarian, Edward W. Wild
AUTOMATICA
2004
109views more  AUTOMATICA 2004»
14 years 11 months ago
Optimal stationary behavior for a class of timed continuous Petri nets
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
Bruno Gaujal, Alessandro Giua