Sciweavers

2911 search results - page 318 / 583
» A Logic of Graph Constraints
Sort
View
175
Voted
DAC
1989
ACM
15 years 10 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
NAACL
2003
15 years 8 months ago
Language choice models for microplanning and readability
This paper describes the construction of language choice models for the microplanning of discourse relations in a Natural Language Generation system that attempts to generate appr...
Sandra Williams
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Symmetry within and between solutions
Symmetry can be used to help solve many problems. For instance, Einstein's famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to help derive...
Toby Walsh
JETAI
2008
93views more  JETAI 2008»
15 years 6 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
ICFP
2007
ACM
16 years 6 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni