Sciweavers

514 search results - page 9 / 103
» On enumerating all minimal solutions of feedback problems
Sort
View
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
COR
2006
95views more  COR 2006»
13 years 7 months ago
Generating optimal two-section cutting patterns for rectangular blanks
This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists o...
Yaodong Cui, Dongli He, Xiaoxia Song
IJPP
2008
74views more  IJPP 2008»
13 years 7 months ago
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
Ahmad Faraj, Pitch Patarasuk, Xin Yuan
SOCC
2008
IEEE
124views Education» more  SOCC 2008»
14 years 1 months ago
Energy minimization using a greedy randomized heuristic for the voltage assignment problem in NoC
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
Pavel Ghosh, Arunabha Sen
ENTCS
2008
97views more  ENTCS 2008»
13 years 7 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann