757 search results - page 55 / 152 » On the hardness of approximating Max-Satisfy |
ESANN
2004
14 years 11 months ago
2004
Several reinforcement-learning techniques have already been applied to the Acrobot control problem, using linear function approximators to estimate the value function. In this pape...
AAAI
2010
14 years 11 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
108
click to vote
CATS
2006
14 years 11 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
105
click to vote
DATE
2009
IEEE
15 years 1 months ago
2009
IEEE
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...