10848 search results - page 286 / 2170 » Programming in Biomolecular Computation |
181
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
208
click to vote
NCA
2008
IEEE
15 years 6 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
149
click to vote
ANOR
2005
15 years 5 months ago
2005
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
187
click to vote
TSMC
2010
15 years 20 days ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
203
click to vote
PPOPP
2011
ACM
14 years 8 months ago
2011
ACM
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...