2905 search results - page 209 / 581 » Formal Memetic Algorithms |
SIGECOM
2005
ACM
14 years 4 months ago
2005
ACM
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
CHARME
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
This paper presents a statistical learning approach to predicting people's bidding behavior in negotiation. Our study consists of multiple 2-player negotiation scenarios wher...
CP
1995
Springer
14 years 2 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
AAAI
1997
14 years 2 days ago
1997
In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...