Sciweavers

7924 search results - page 1494 / 1585
» Non-Malleable Functions and Their Applications
Sort
View
CIE
2007
Springer
14 years 3 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
DAWAK
2007
Springer
14 years 3 months ago
Mining Top-K Multidimensional Gradients
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
Ronnie Alves, Orlando Belo, Joel Ribeiro
ECSQARU
2007
Springer
14 years 3 months ago
Towards an Extensible Argumentation System
Many types of inter-agent dialogue, including information seeking, negotiation and deliberation can be fruitfully seen as varieties of argumentation. Argumentation frameworks, ori...
Adam Zachary Wyner, Trevor J. M. Bench-Capon
ER
2007
Springer
137views Database» more  ER 2007»
14 years 3 months ago
Prioritized Preferences and Choice Constraints
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental is...
Wilfred Ng
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 3 months ago
Unwitting distributed genetic programming via asynchronous JavaScript and XML
The success of a genetic programming system in solving a problem is often a function of the available computational resources. For many problems, the larger the population size an...
Jon Klein, Lee Spector
« Prev « First page 1494 / 1585 Last » Next »