Sciweavers

994 search results - page 62 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
99
Voted
CSR
2009
Springer
15 years 4 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
ASM
2008
ASM
15 years 2 months ago
UML-B: A Plug-in for the Event-B Tool Set
UML-B provides a graphical front end for Event-B. It adds support for class-oriented and state machine modelling. UML-B is similar to UML but has its own meta-model. UML-B provides...
Colin F. Snook, Michael J. Butler
106
Voted
COLING
2010
14 years 7 months ago
An Efficient Shift-Reduce Decoding Algorithm for Phrased-Based Machine Translation
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
Yang Feng, Haitao Mi, Yang Liu, Qun Liu
GPEM
2002
104views more  GPEM 2002»
15 years 15 days ago
Genetic Programming-based Construction of Features for Machine Learning and Knowledge Discovery Tasks
In this paper we use genetic programming for changing the representation of the input data for machine learners. In particular, the topic of interest here is feature construction i...
Krzysztof Krawiec
SAC
2005
ACM
15 years 6 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq