Sciweavers

4131 search results - page 184 / 827
» Compactness in Topology and Computation
Sort
View
TCS
2008
15 years 6 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
EUROCAST
2005
Springer
97views Hardware» more  EUROCAST 2005»
16 years 4 hour ago
Extracting Computer Algebra Programs from Statements
In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been me...
Jesús Aransay, Clemens Ballarin, Julio Rubi...
ICCNMC
2005
Springer
15 years 12 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
FPL
2001
Springer
102views Hardware» more  FPL 2001»
15 years 11 months ago
A Generic Library for Adaptive Computing Environments
The Generic Library for Adaptive Computing Environments (GLACE) consists of a comprehensive set of module generators currently targeting Xilinx XC4000 and Virtex devices. In contra...
Tilman Neumann, Andreas Koch
ENTCS
2007
86views more  ENTCS 2007»
15 years 6 months ago
On the Non-sequential Nature of Domain Models of Real-number Computation
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
Thomas Anberrée