Sciweavers

7103 search results - page 971 / 1421
» Program Generation and Components
Sort
View
RECOMB
2005
Springer
16 years 5 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
CADE
2002
Springer
16 years 5 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
VLDB
2007
ACM
118views Database» more  VLDB 2007»
16 years 5 months ago
Eliminating Impedance Mismatch in C++
Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]--the Language INtegrated Query technology from Microsoft. LINQ represents a set of lan...
Joseph Gil, Keren Lenz
ICSE
2003
IEEE-ACM
16 years 5 months ago
DADO: Enhancing Middleware to Support Crosscutting Features in Distributed, Heterogeneous Systems
Some "non-' or "extra-functional" features, such as reliability, security, and tracing, defy modularization mechanisms in programming languages. This makes suc...
Eric Wohlstadter, Stoney Jackson, Premkumar T. Dev...
129
Voted
EWSN
2008
Springer
16 years 4 months ago
Characterizing Mote Performance: A Vector-Based Methodology
Sensors networks instrument the physical space using motes that run network embedded programs thus acquiring, processing, storing and transmitting sensor data. The motes commercial...
Martin Leopold, Marcus Chang, Philippe Bonnet