Sciweavers

2085 search results - page 89 / 417
» Special interest groups
Sort
View
CP
2001
Springer
15 years 11 months ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
16 years 7 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
KESAMSTA
2009
Springer
16 years 1 months ago
An Approximate Model for Bidders in Sequential Automated Auctions
In this paper, we propose a probabilistic model to study the interaction of bidder and seller agents in sequential automated auctions. We consider a designated “special bidder”...
Erol Gelenbe, Kumaara Velan
SAT
2007
Springer
184views Hardware» more  SAT 2007»
16 years 18 days ago
Circuit Based Encoding of CNF Formula
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
Gilles Audemard, Lakhdar Sais
AAI
2005
124views more  AAI 2005»
15 years 6 months ago
Lessons From Emotion Psychology For The Design Of Lifelike Characters
This special issue describes a number of applications that utilize lifelike characters that teach indirectly, by playing some role in a social interaction with a user. The design ...
Jonathan Gratch, Stacy Marsella