Sciweavers

595 search results - page 104 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
PLDI
2010
ACM
14 years 14 days ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
BMCBI
2008
104views more  BMCBI 2008»
13 years 7 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
CP
2006
Springer
13 years 11 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
VLSISP
2002
112views more  VLSISP 2002»
13 years 7 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
EMS
2009
IEEE
14 years 2 months ago
Accurate Timeliness Simulations for Real-Time Wireless Sensor Networks
—The use of wireless sensor networks is rapidly growing in various types of applications that benefit from spatially distributed data collection. Some of these applications, suc...
Jérôme Rousselot, Jean-Dominique Deco...