Sciweavers

230 search results - page 1 / 46
» Efficient algorithms for acceptable design exploration
Sort
View
GLVLSI
2000
IEEE
80views VLSI» more  GLVLSI 2000»
13 years 9 months ago
Efficient algorithms for acceptable design exploration
Chantana Chantrapornchai, Edwin Hsing-Mean Sha, Xi...
EUC
2004
Springer
13 years 9 months ago
Efficient Scheduling for Design Exploration with Imprecise Latency and Register Constraints
In archiectural synthesis, scheduling and resource allocation are important steps. During the early stage of the design, imprecise information is unavoidable. Under the imprecise ...
Chantana Chantrapornchai, Wanlop Surakumpolthorn, ...
GLVLSI
1999
IEEE
97views VLSI» more  GLVLSI 1999»
13 years 9 months ago
Efficient Algorithms for Finding Highly Acceptable Designs Based on Module-Utility Selections
Chantana Chantrapornchai, Edwin Hsing-Mean Sha, Xi...
CORR
1999
Springer
116views Education» more  CORR 1999»
13 years 5 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 5 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...