Sciweavers

3758 search results - page 317 / 752
» A Complete Subsumption Algorithm
Sort
View
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
16 years 1 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula
SAT
2009
Springer
82views Hardware» more  SAT 2009»
16 years 1 months ago
Generalizing Core-Guided Max-SAT
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
Mark H. Liffiton, Karem A. Sakallah
SEMWEB
2009
Springer
16 years 1 months ago
ASMOV: Results for OAEI 2009
The Automated Semantic Mapping of Ontologies with Validation (ASMOV) algorithm for ontology alignment was one of the top performing algorithms in the 2007 and 2008 Ontology Alignme...
Yves R. Jean-Mary, E. Patrick Shironoshita, Mansur...
GLOBECOM
2008
IEEE
16 years 1 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
INFOCOM
2008
IEEE
16 years 1 months ago
Towards a Theory of Robust Localization Against Malicious Beacon Nodes
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...
Sheng Zhong, Murtuza Jadliwala, Shambhu J. Upadhya...