3875 search results - page 328 / 775 » Approximation algorithms for the 0-extension problem |
206
click to vote
QEST
2008
IEEE
16 years 1 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
176
click to vote
FORMATS
2004
Springer
16 years 6 days ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
183
click to vote
WEA
2007
Springer
16 years 28 days ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
175
click to vote
AAAI
2006
15 years 8 months ago
2006
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
207
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...