1798 search results - page 263 / 360 » Generating presentation constraints from rhetorical structur... |
113
Voted
JFP
2000
15 years 15 days ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
105
Voted
SIGMOD
2004
ACM
16 years 26 days ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
109
click to vote
CC
2009
Springer
15 years 5 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
104
click to vote
IJRR
2007
15 years 19 days ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
94
Voted
ICCAD
2006
IEEE
15 years 9 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...