4524 search results - page 603 / 905 » The Complexity of Global Constraints |
222
click to vote
DIALM
2005
ACM
15 years 9 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
221
click to vote
COCO
2008
Springer
15 years 9 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
200
click to vote
ECAI
2008
Springer
15 years 9 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
170
click to vote
EUROPAR
2008
Springer
15 years 9 months ago
2008
Springer
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
151
click to vote
ISLPED
2007
ACM
15 years 9 months ago
2007
ACM
A 0.4-V UWB digital baseband processor has been fabricated in a standard-VT 90-nm CMOS technology. The baseband processor operates at an ultra-low supply voltage to reduce energy ...