Sciweavers

1989 search results - page 229 / 398
» Set functions for functional logic programming
Sort
View
235
Voted
ECOOP
2009
Springer
16 years 4 months ago
Making Sense of Large Heaps
Abstract. It is common for large-scale Java applications to suffer memory problems, whether inefficient designs that impede scalability, or lifetime bugs such as leaks. Making sens...
Nick Mitchell, Edith Schonberg, Gary Sevitsky
143
Voted
ICFP
2005
ACM
16 years 3 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
123
Voted
IJCAI
2003
15 years 4 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
FCCM
2003
IEEE
113views VLSI» more  FCCM 2003»
15 years 8 months ago
Issues and Approaches to Coarse-Grain Reconfigurable Architecture Development
Although domain-specialized FPGAs can offer significant area, speed and power improvements over conventional reconfigurable devices, there are several unique and unexplored design...
Kenneth Eguro, Scott Hauck
DATE
2000
IEEE
136views Hardware» more  DATE 2000»
15 years 8 months ago
On Applying Incremental Satisfiability to Delay Fault Testing
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah...