Sciweavers

2477 search results - page 335 / 496
» Approximate extended formulations
Sort
View
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
15 years 9 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
WEBI
2005
Springer
15 years 9 months ago
Integrating Element and Term Semantics for Similarity-Based XML Document Clustering
Structured link vector model (SLVM) is a recently proposed document representation that takes into account both structural and semantic information for measuring XML document simi...
Jianwu Yang, William K. Cheung, Xiaoou Chen
ATAL
2004
Springer
15 years 9 months ago
Time-Variant Distributed Agent Matching Applications
The process of pair partnership formation is an important infrastructure for many plausible MAS applications. Each agent evaluates potential partner agents, where each potential m...
David Sarne, Sarit Kraus
AUSAI
2004
Springer
15 years 9 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
157
Voted
CSCLP
2004
Springer
15 years 9 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov