Sciweavers

4451 search results - page 52 / 891
» On Random Ordering Constraints
Sort
View
NIPS
2004
15 years 5 months ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
FDL
2008
IEEE
15 years 10 months ago
Contradiction Analysis for Constraint-based Random Simulation
Constraint-based random simulation is state-of-the-art in verification of multi-million gate industrial designs. This method is based on stimulus generation by constraint solving...
Daniel Große, Robert Wille, Robert Siegmund,...
145
Voted
AAAI
2004
15 years 5 months ago
A Comparison of Techniques for Scheduling Earth Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
Al Globus, James Crawford, Jason D. Lohn, Anna Pry...
INFOCOM
2007
IEEE
15 years 10 months ago
Connectivity and Capacity of Multi-Channel Wireless Networks with Channel Switching Constraints
— This paper argues for the need to address the issue of multi-channel network performance under constraints on channel switching. We present examples from emergent directions in...
Vartika Bhandari, Nitin H. Vaidya
CSCLP
2005
Springer
15 years 9 months ago
On Generators of Random Quasigroup Problems
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
Roman Barták