11 search results - page 2 / 3 » Generating Coalition Structures with Finite Bound from the O... |
CSCLP
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
VISUALIZATION
1999
IEEE
13 years 9 months ago
1999
IEEE
We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a sce...
CGF
2006
13 years 5 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
ICCAD
2006
IEEE
14 years 2 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...