Sciweavers

3663 search results - page 487 / 733
» Problems in the ontology of computer programs
Sort
View
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
JDI
2006
45views more  JDI 2006»
15 years 6 months ago
The Next Killer Ap
: The next `killer ap' is a term the software development community uses to describe its great quest for advancing technology by defining and meeting users' needs and wan...
MP
2008
115views more  MP 2008»
15 years 6 months ago
An efficient approach to updating simplex multipliers in the simplex algorithm
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
Jian-Feng Hu, Ping-Qi Pan
TCS
2010
15 years 5 months ago
Adaptive star grammars and their languages
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
CLOUDCOM
2010
Springer
15 years 4 months ago
Applying Twister to Scientific Applications
Many scientific applications suffer from the lack of a unified approach to support the management and efficient processing of large-scale data. The Twister MapReduce Framework, whi...
Bingjing Zhang, Yang Ruan, Tak-Lon Wu, Judy Qiu, A...