Sciweavers

3885 search results - page 246 / 777
» Clarifying Goal Models
Sort
View
COMPLEXITY
2010
129views more  COMPLEXITY 2010»
15 years 2 months ago
The notion of computation is fundamental to an autonomous neuroscience
The increasing sophistication of the tools and results of cellular and molecular neuroscience would appear to suggest that explanatory force in neuroscience is defined by reductio...
Garrett Neske
SOFSEM
2010
Springer
16 years 2 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina
SIBGRAPI
2008
IEEE
15 years 12 months ago
Structural Matching of 2D Electrophoresis Gels using Graph Models
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
SAT
2005
Springer
142views Hardware» more  SAT 2005»
15 years 11 months ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...
GPCE
2003
Springer
15 years 10 months ago
A Case for Test-Code Generation in Model-Driven Systems
A primary goal of generative programming and model-driven ent is to raise the level of abstraction at which designers and developers interact with the software systems they are bui...
Matthew J. Rutherford, Alexander L. Wolf