Sciweavers

272 search results - page 20 / 55
» Programming languages capturing complexity classes
Sort
View
84
Voted
ECOOP
2007
Springer
15 years 7 months ago
Metaprogramming with Traits
Abstract. In many domains, classes have highly regular internal structure. For example, so-called business objects often contain boilerplate code for mapping database fields to cl...
John H. Reppy, Aaron Turon
UAI
1997
15 years 2 months ago
Object-Oriented Bayesian Networks
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
Daphne Koller, Avi Pfeffer
93
Voted
SIGADA
2004
Springer
15 years 6 months ago
GNAT: on the road to Ada 2005
The GNAT Development Team is directly involved with the Ada 2005 effort, both participating in the Ada Rapporteur Group (ARG), and implementing and testing the new features propo...
Javier Miranda, Edmond Schonberg
106
Voted
CP
2007
Springer
15 years 7 months ago
Tradeoffs in the Complexity of Backdoor Detection
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
89
Voted
SAIG
2000
Springer
15 years 4 months ago
On Jones-Optimal Specialization for Strongly Typed Languages
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
Henning Makholm