Sciweavers

4940 search results - page 755 / 988
» On the Complexity of Universal Programs
Sort
View
CSJM
2006
59views more  CSJM 2006»
15 years 6 months ago
Traveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
Valeriu Ungureanu
ENTCS
2006
140views more  ENTCS 2006»
15 years 6 months ago
An Aspect-Oriented Approach to Modular Behavioral Specification
Behavioral interface specification languages, such as Java Modeling Language (JML), can be used to specify the behavior of program modules. We have developed a behavioral interfac...
Kiyoshi Yamada, Takuo Watanabe
ENTCS
2006
145views more  ENTCS 2006»
15 years 6 months ago
Automated Derivation of Translators From Annotated Grammars
In this paper we propose a technique to automate the process of building translators between operations languages, a family of DSLs used to program satellite operations procedures...
Diego Ordóñez Camacho, Kim Mens, Mar...
FGCS
2006
70views more  FGCS 2006»
15 years 6 months ago
GrAL--the grid algorithms library
6 Dedicated library support for mesh-level geometry components, central to numerical PDE solution, is scarce. We claim that the situation is due to the inadequacy of traditional de...
Guntram Berti
CORR
2007
Springer
68views Education» more  CORR 2007»
15 years 6 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella