Sciweavers

794 search results - page 16 / 159
» Improved algorithms for orienteering and related problems
Sort
View
CORR
2007
Springer
68views Education» more  CORR 2007»
13 years 10 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
COLT
1998
Springer
14 years 2 months ago
Improved Boosting Algorithms using Confidence-Rated Predictions
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
Robert E. Schapire, Yoram Singer
AOSE
2005
Springer
14 years 3 months ago
Aspects in Agent-Oriented Software Engineering: Lessons Learned
Several concerns in the development of multi-agent systems (MASs) cannot be represented in a modular fashion. In general, they inherently affect several system modules and cannot b...
Alessandro F. Garcia, Uirá Kulesza, Cl&aacu...
ICMLA
2009
13 years 7 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
14 years 7 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani