Sciweavers

9949 search results - page 1836 / 1990
» On the Network Complexity of Selection
Sort
View
EUROPAR
1999
Springer
15 years 8 months ago
DAOS - Scalable And-Or Parallelism
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
Luís Fernando Castro, Vítor Santos C...
FPL
1999
Springer
147views Hardware» more  FPL 1999»
15 years 8 months ago
Synthia: Synthesis of Interacting Automata Targeting LUT-based FPGAs
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
George A. Constantinides, Peter Y. K. Cheung, Wayn...
RECOMB
1999
Springer
15 years 8 months ago
Evolution of metabolisms: a new method for the comparison of metabolic pathways
The abundance of information provided by completely sequenced genomes de nes a starting point for new insights in the multilevel organization of organisms and their evolution. At ...
Christian V. Forst, Klaus Schulten
WETICE
1998
IEEE
15 years 8 months ago
A Deontic Formalism for Co-ordinating Software Development in Virtual Software Corporations
The concept of the Virtual Software Corporation (VSC) has recently become a practical reality as a result of advances in communication and distributed technologies. However, there...
Zsolt Haag, Richard Foley, Julian Newman
FOCS
1997
IEEE
15 years 8 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
« Prev « First page 1836 / 1990 Last » Next »