Sciweavers

1963 search results - page 33 / 393
» The Maximum Solution Problem on Graphs
Sort
View
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
14 years 3 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
JMLR
2010
144views more  JMLR 2010»
13 years 3 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
EC
2008
153views ECommerce» more  EC 2008»
13 years 8 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
WWW
2004
ACM
14 years 9 months ago
Authoring of learning styles in adaptive hypermedia: problems and solutions
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
Natalia Stash, Alexandra I. Cristea, Paul De Bra
GLOBECOM
2007
IEEE
14 years 3 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong