2080 search results - page 106 / 416 » Measuring empirical computational complexity |
127
click to vote
EMSOFT
2007
Springer
15 years 10 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
146
click to vote
SGP
2004
15 years 6 months ago
2004
In this paper, we present the Symmetry Descriptors of a 3D model. This is a collection of spherical functions that describes the measure of a model's rotational and reflectiv...
128
click to vote
IWANN
2009
Springer
15 years 10 months ago
2009
Springer
Parallel computing has become an important research field in the last years. The availability of hardware and the success of grid computing have motivated this interest. In this pa...
130
click to vote
IJCAI
2007
15 years 5 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
141
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...