Sciweavers

6455 search results - page 93 / 1291
» Research problems
Sort
View
130
Voted
JMLR
2006
124views more  JMLR 2006»
15 years 2 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
137
Voted
ICNS
2009
IEEE
15 years 11 days ago
Evaluation of Free-Riding Traffic Problem in Overlay Routing and Its Mitigation Method
Recent research on overlay networks has revealed that user-perceived network performance could be improved by an overlay routing mechanism. The effectiveness of overlay routing is ...
Go Hasegawa, Yuichiro Hiraoka, Masayuki Murata
127
Voted
INFORMS
2010
147views more  INFORMS 2010»
14 years 12 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
113
Voted
ECIS
2001
15 years 4 months ago
Using Problem-Domain and Artefact-Domain Architectural Modelling to Understand System Evolution
The authors describe on going research to uncover the architectonic nature of artefacts and see how these may be related to high-level, but also grounded, model of the original pr...
Thomas R. Addis, Galal Hassan Galal
125
Voted
CPAIOR
2007
Springer
15 years 8 months ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen