Sciweavers

8109 search results - page 1170 / 1622
» A Model of Component-Based Programming
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
15 years 6 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
ANOR
2010
102views more  ANOR 2010»
15 years 6 months ago
Optimal control of dosage decisions in controlled ovarian hyperstimulation
Abstract In the controlled ovary hyperstimulation (COH) cycle of the in vitro fertilization-embryo transfer (IVFET) therapy, the clinicians observe the patients' responses to ...
Miao He, Lei Zhao, Warren B. Powell
COR
2008
99views more  COR 2008»
15 years 6 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 6 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
« Prev « First page 1170 / 1622 Last » Next »