Sciweavers

10608 search results - page 1779 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
WABI
2005
Springer
124views Bioinformatics» more  WABI 2005»
15 years 6 months ago
Reconstructing Metabolic Networks Using Interval Analysis
Recently, there has been growing interest in the modelling and simulation of biological systems. Such systems are often modelled in terms of coupled ordinary differential equation...
Warwick Tucker, Vincent Moulton
107
Voted
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
15 years 6 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
89
Voted
WINE
2005
Springer
122views Economy» more  WINE 2005»
15 years 6 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
107
Voted
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
15 years 6 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
84
Voted
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 6 months ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...
« Prev « First page 1779 / 2122 Last » Next »