Sciweavers

1963 search results - page 56 / 393
» The Maximum Solution Problem on Graphs
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 2 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
IJCAI
2007
13 years 10 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
OL
2010
87views more  OL 2010»
13 years 7 months ago
Uniqueness of integer solution of linear equations
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...
O. L. Mangasarian, Michael C. Ferris
PODS
1991
ACM
98views Database» more  PODS 1991»
14 years 6 days ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
TCOM
2008
120views more  TCOM 2008»
13 years 8 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief