Sciweavers

14 search results - page 2 / 3
» Removing Cycles in Esterel Programs
Sort
View
CP
2005
Springer
13 years 10 months ago
Domain Reduction for the Circuit Constraint
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...
Latife Genç Kaya, John N. Hooker
CISIS
2010
IEEE
14 years 3 days ago
Logic-Based Steady-State Analysis and Revision of Metabolic Networks with Inhibition
—This paper presents a qualitative logic-based method for the steady-state analysis and revision of metabolic networks with inhibition. The approach is able to automatically revi...
Oliver Ray, Ken E. Whelan, Ross D. King
SENSYS
2006
ACM
13 years 11 months ago
Protothreads: simplifying event-driven programming of memory-constrained embedded systems
Event-driven programming is a popular model for writing programs for tiny embedded systems and sensor network nodes. While event-driven programming can keep the memory overhead do...
Adam Dunkels, Oliver Schmidt, Thiemo Voigt, Muneeb...
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
13 years 9 months ago
Better Global Scheduling Using Path Profiles
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
Cliff Young, Michael D. Smith
JCO
1998
136views more  JCO 1998»
13 years 4 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...