Sciweavers

16404 search results - page 935 / 3281
» A set coverage problem
Sort
View
GD
2006
Springer
15 years 11 months ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
15 years 11 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
DAC
1995
ACM
15 years 11 months ago
Conflict Modelling and Instruction Scheduling in Code Generation for In-House DSP Cores
Application domain specific DSP cores are becoming increasingly popular due to their advantageous trade–off between flexibility and cost. However, existing code generation metho...
Adwin H. Timmer, Marino T. J. Strik, Jef L. van Me...
DOOD
1995
Springer
102views Database» more  DOOD 1995»
15 years 11 months ago
Active Database Rules with Transaction-Conscious Stable-Model Semantics
Semantics represents a major problem area for active databases inasmuch as (i) there is l framework for defining the abstract semantics of active rules, and (ii) the various syst...
Carlo Zaniolo
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
15 years 11 months ago
Permutation Groups in NC
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
László Babai, Eugene M. Luks, &Aacut...