Sciweavers

74 search results - page 12 / 15
» An Evaluation of Slicing Algorithms for Concurrent Programs
Sort
View
EPIA
1999
Springer
15 years 1 months ago
Improving Optical Music Recognition by Means of Abductive Constraint Logic Programming
In this paper we propose a hybrid system that bridges the gap between traditional image processing methods, used for low-level object recognition, and abductive constraint logic pr...
Miguel Ferrand, João Alexandre Leite, Am&ia...
ASPLOS
2011
ACM
14 years 1 months ago
Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory
Transactional memory (TM) is a promising synchronization mechanism for the next generation of multicore processors. Best-effort Hardware Transactional Memory (HTM) designs, such a...
Luke Dalessandro, François Carouge, Sean Wh...
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 3 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
PPOPP
2012
ACM
13 years 5 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
RV
2010
Springer
171views Hardware» more  RV 2010»
14 years 7 months ago
Runtime Verification for Software Transactional Memories
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
Vasu Singh