Sciweavers

10072 search results - page 1570 / 2015
» Composition of Model Programs
Sort
View
COR
2008
99views more  COR 2008»
15 years 7 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
FUIN
2008
116views more  FUIN 2008»
15 years 7 months ago
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
Jos de Bruijn, Stijn Heymans
ENTCS
2006
136views more  ENTCS 2006»
15 years 6 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand
IJRR
2008
101views more  IJRR 2008»
15 years 6 months ago
Motion Planning Under Uncertainty for Image-guided Medical Needle Steering
We develop a new motion planning algorithm for a variant of a Dubins car with binary left/right steering and apply it to steerable needles, a new class of flexible beveltip medica...
Ron Alterovitz, Michael S. Branicky, Kenneth Y. Go...
ISCA
2008
IEEE
143views Hardware» more  ISCA 2008»
15 years 6 months ago
TokenTM: Efficient Execution of Large Transactions with Hardware Transactional Memory
Current hardware transactional memory systems seek to simplify parallel programming, but assume that large transactions are rare, so it is acceptable to penalize their performance...
Jayaram Bobba, Neelam Goyal, Mark D. Hill, Michael...
« Prev « First page 1570 / 2015 Last » Next »