Sciweavers

193 search results - page 33 / 39
» sat 2007
Sort
View
APCCM
2009
14 years 10 months ago
Conceptional Modeling and Analysis of Spatio-Temporal Processes in Biomolecular Systems
In life science, deeper understanding of biomolecular systems is acquired by computational modeling and analysis. For the modeling of several kinds of reaction networks, e.g. sign...
Andreas Schäfer, Mathias John
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
15 years 3 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
CORR
2007
Springer
117views Education» more  CORR 2007»
14 years 9 months ago
An annotation based approach to support design communication
The aim of this paper is to propose an approach based on the concept of annotation for supporting design communication. In this paper, we describe a co-operative design case study...
Onur Hisarciklilar, Jean-François Boujut
NIPS
2008
14 years 11 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin