Sciweavers

1743 search results - page 270 / 349
» Generalized Modal Satisfiability
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 26 days ago
A Unique "Nonnegative" Solution to an Underdetermined System: from Vectors to Matrices
Abstract--This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A...
Meng Wang, Weiyu Xu, Ao Tang
107
Voted
AAAI
2010
15 years 18 days ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen
121
Voted
GLOBECOM
2010
IEEE
15 years 16 days ago
Sliding Mode Based Joint Congestion Control and Scheduling in Multi-Hop Ad Hoc Networks with Multi-Class Services
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
Zongrui Ding, Dapeng Wu
119
Voted
IPPS
2010
IEEE
15 years 14 days ago
A lock-free, cache-efficient multi-core synchronization mechanism for line-rate network traffic monitoring
Line-rate data traffic monitoring in high-speed networks is essential for network management. To satisfy the line-rate requirement, one can leverage multi-core architectures to par...
Patrick P. C. Lee, Tian Bu, Girish P. Chandranmeno...
121
Voted
QEST
2010
IEEE
15 years 13 days ago
Information Hiding in Probabilistic Concurrent Systems
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
Miguel E. Andrés, Catuscia Palamidessi, Pet...