97 search results - page 14 / 20 » From Specialized Syntax to General Logic: The Case of Compar... |
IJCAI
1989
14 years 10 months ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
DAC
2012
ACM
13 years 17 hour ago
2012
ACM
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
JACM
2000
14 years 9 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
GLVLSI
2007
IEEE
15 years 4 months ago
2007
IEEE
We propose an interconnect reorganization algorithm for reduction stages in parallel multipliers. It aims at minimizing power consumption for given static probabilities at the pri...
RTCSA
1999
IEEE
15 years 1 months ago
1999
IEEE
While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as co...