Sciweavers

555 search results - page 71 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
AIR
2010
96views more  AIR 2010»
13 years 7 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
CN
2006
106views more  CN 2006»
13 years 7 months ago
Efficient large-scale BGP simulations
Simulation has been the method of choice for analyzing large, complex, and highly volatile systems. One of these systems is the inter-domain routing infrastructure of the Internet...
Xenofontas A. Dimitropoulos, George F. Riley
AOSD
2010
ACM
14 years 2 months ago
Execution levels for aspect-oriented programming
In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if p...
Éric Tanter
ASPLOS
2006
ACM
14 years 1 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
ICFP
2010
ACM
13 years 8 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones