705 search results - page 56 / 141 » New Compilation Languages Based on Structured Decomposabilit... |
CC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Scientists are increasingly using dynamic programming languages like Matlab for prototyping and implementation. Effectively compiling Matlab raises many challenges due t...
IJCAI
2003
14 years 11 months ago
2003
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number ...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
TSP
2008
14 years 9 months ago
2008
In this paper, we consider the problem of blind multiuser separation-equalization in the uplink of a wideband DS-CDMA system, in a multipath propagation environment with intersymbo...
ISBI
2007
IEEE
15 years 4 months ago
2007
IEEE
Quantification and visualization of anatomical shape variability in different populations is essential for diagnosis and tracking progression of diseases. We present a new 3D med...