Sciweavers

1814 search results - page 152 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
CP
1995
Springer
15 years 10 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace
ICDM
2002
IEEE
133views Data Mining» more  ICDM 2002»
15 years 11 months ago
Learning with Progressive Transductive Support Vector Machine
Support vector machine (SVM) is a new learning method developed in recent years based on the foundations of statistical learning theory. By taking a transductive approach instead ...
Yisong Chen, Guoping Wang, Shihai Dong
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 10 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
PR
2008
88views more  PR 2008»
15 years 6 months ago
Modified global k
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
Adil M. Bagirov
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 10 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace