2976 search results - page 469 / 596 » On the bounded integer programming |
ESOP
2011
Springer
13 years 18 days ago
2011
Springer
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
ESOP
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Variant parametric types (VPT) represent the successful result of combining subtype polymorphism with parametric polymorphism to support a more flexible subtyping for Ja...
ICCAD
1997
IEEE
14 years 1 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...