3454 search results - page 232 / 691 » Modern computer algebra |
142
click to vote
VLSID
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
164
click to vote
MFCS
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
139
click to vote
LICS
2006
IEEE
16 years 18 days ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
179
click to vote
MDM
2005
Springer
16 years 2 days ago
2005
Springer
In this paper we propose a query-driven approach for tuning the time/energy trade-off in sensor networks with mobile sensors. The tuning factors include re-positioning of mobile s...
171
click to vote
ICCS
2004
Springer
15 years 12 months ago
2004
Springer
We show in this paper how to evaluate the performance of skeleton-based high level parallel programs. Since many applications follow some commonly used algorithmic skeletons, we id...