Sciweavers

3318 search results - page 125 / 664
» The Weak Instance Model
Sort
View
AI
2008
Springer
13 years 8 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
ENTCS
2008
70views more  ENTCS 2008»
13 years 8 months ago
Separate Compilation of Polychronous Specifications
As code generation for synchronous programs requires strong safety properties to be satisfied, compositionality becomes a difficult goal to achieve. Most synchronous languages, su...
Julien Ouy, Jean-Pierre Talpin, Loïc Besnard,...
JCM
2006
92views more  JCM 2006»
13 years 8 months ago
Ultimate Dynamic Spectrum Allocation via User-Central Wireless Systems
- Current wireless systems are called vendor-central systems because, users should subscribe to a service provider (vendor) and receive the service through the spectrum assigned to...
Seyed Alireza Zekavat, Xiukui Li
JAR
2000
123views more  JAR 2000»
13 years 7 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
JSAC
2010
170views more  JSAC 2010»
13 years 2 months ago
Anti-jamming broadcast communication using uncoordinated spread spectrum techniques
Jamming-resistant communication is crucial for safety-critical applications such as emergency alert broadcasts or the dissemination of navigation signals in adversarial settings. I...
Christina Pöpper, Mario Strasser, Srdjan Capk...