Sciweavers

1142 search results - page 142 / 229
» Approximability of Clausal Constraints
Sort
View
DSD
2008
IEEE
139views Hardware» more  DSD 2008»
15 years 8 months ago
Discrete Particle Swarm Optimization for Multi-objective Design Space Exploration
Platform-based design represents the most widely used approach to design System-On-Chip (SOC) applications. In this context, the Design Space Exploration (DSE) phase consists of o...
Gianluca Palermo, Cristina Silvano, Vittorio Zacca...
ACL
2007
15 years 7 months ago
A Grammar-driven Convolution Tree Kernel for Semantic Role Classification
Convolution tree kernel has shown promising results in semantic role classification. However, it only carries out hard matching, which may lead to over-fitting and less accurate s...
Min Zhang, Wanxiang Che, AiTi Aw, Chew Lim Tan, Gu...
AAAI
2006
15 years 7 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
AAAI
1998
15 years 7 months ago
Bayesian Network Models for Generation of Crisis Management Training Scenarios
We present a noisy-OR Bayesian network model for simulation-based training, and an efficient search-based algorithm for automatic synthesis of plausible training scenarios from co...
Eugene Grois, William H. Hsu, Mikhail Voloshin, Da...
IPCO
1998
99views Optimization» more  IPCO 1998»
15 years 7 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...