Sciweavers

4190 search results - page 273 / 838
» Type Class Directives
Sort
View
COLOGNETWENTE
2008
15 years 6 months ago
Reformulations in Mathematical Programming: Definitions
Abstract. A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are i...
Leo Liberti
147
Voted
IMECS
2007
15 years 6 months ago
Using Background Knowledge for Graph Based Learning: A Case Study in Chemoinformatics
The benefit of incorporating background knowledge in the learning process has been successfully demonstrated in numerous applications of ILP methods. Nevertheless the effect of inc...
Thashmee Karunaratne, Henrik Boström
AAAI
1998
15 years 6 months ago
On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...
Berthe Y. Choueiry, Guevara Noubir
AMCS
2008
124views Mathematics» more  AMCS 2008»
15 years 4 months ago
Approximate Controllability of Infinite Dimensional Systems of the n-th Order
The objective of the article is to obtain general conditions for several types of controllability at once for an abstract differential equation of arbitrary order, instead of condi...
Jerzy Stefan Respondek
ENTCS
2008
90views more  ENTCS 2008»
15 years 4 months ago
Quantum Data and Control Made Easier
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage�...
Michael Lampis, Kyriakos G. Ginis, Michalis A. Pap...