Sciweavers

4110 search results - page 85 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
AAMAS
2005
Springer
15 years 3 months ago
Efficient Management of Multi-Linked Negotiation Based on a Formalized Model
A Multi-linked negotiation problem occurs when an agent needs to negotiate with multiple other agents about different subjects (tasks, conflicts, or resource requirements), and th...
Xiaoqin Zhang, Victor R. Lesser, Sherief Abdallah
JAR
2000
145views more  JAR 2000»
15 years 3 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 4 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
KDD
1997
ACM
78views Data Mining» more  KDD 1997»
15 years 8 months ago
Mining Generalized Term Associations: Count Propagation Algorithm
We presenthere an approachand algorithm for mining generalizedterm associations.The problem is to find co-occurrencefrequenciesof terms, given a collection of documents eachwith r...
Jonghyun Kahng, Wen-Hsiang Kevin Liao, Dennis McLe...
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
15 years 5 months ago
Multi-resistant radar jamming using genetic algorithms
The next generation of advanced self-protection jammers is expected to deliver effective and energy efficient jamming against modern air tracking radars. However, optimizing such ...
Hans Jonas Fossum Moen, Stein Kristoffersen