Sciweavers

4315 search results - page 98 / 863
» Sorting in linear time
Sort
View
JSAT
2006
108views more  JSAT 2006»
13 years 9 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
HYBRID
2000
Springer
14 years 18 days ago
Controlled Invariance of Discrete Time Systems
Abstract. An algorithm for computing the maximal controlled invariant set and the least restrictive controller for discrete time systems is proposed. We show how the algorithm can ...
René Vidal, Shawn Schaffert, John Lygeros, ...
ESANN
2006
13 years 10 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
ICS
2004
Tsinghua U.
14 years 2 months ago
Scaling the issue window with look-ahead latency prediction
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...
Yongxiang Liu, Anahita Shayesteh, Gokhan Memik, Gl...
PRL
2008
65views more  PRL 2008»
13 years 9 months ago
Matching of quasi-periodic time series patterns by exchange of block-sorting signatures
We propose a novel method for quasi-periodic time series patterns matching, through signature exchange between the two patterns. The signature is obtained through sorting of the t...
Bachir Boucheham