2398 search results - page 242 / 480 » Constraint Programming and Graph Algorithms |
195
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
164
click to vote
ISLPED
2003
ACM
15 years 11 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
204
click to vote
IPCO
2008
15 years 8 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
158
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
173
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...