Sciweavers

16091 search results - page 333 / 3219
» Solving
Sort
View
JSAT
2006
94views more  JSAT 2006»
15 years 6 months ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
NA
2008
92views more  NA 2008»
15 years 6 months ago
Computing bivariate splines in scattered data fitting and the finite-element method
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
Larry L. Schumaker
TCS
2008
15 years 6 months ago
Election and rendezvous with incomparable labels
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
Jérémie Chalopin
TRANSCI
2008
80views more  TRANSCI 2008»
15 years 6 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
Frédéric Babonneau, Jean-Philippe Vi...
CMOT
2000
123views more  CMOT 2000»
15 years 6 months ago
Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models
A variety of different multi-agent (competitive) network models have been described in the literature. Computational techniques for solving such models often involve the iterative...
Steven A. Gabriel, David Bernstein