Sciweavers

577 search results - page 66 / 116
» Computing Rational Bisectors
Sort
View
WPES
2005
ACM
14 years 1 months ago
The privacy cost of the second-chance offer
This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the a...
Sumit Joshi, Yu-An Sun, Poorvi L. Vora
AI
1998
Springer
13 years 7 months ago
The Logical Foundations of Goal-Regression Planning in Autonomous Agents
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
John L. Pollock
ICICIC
2006
IEEE
14 years 1 months ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
ISSAC
2004
Springer
88views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Non-liouvillian solutions for second order Linear ODEs
There exist sound literature and algorithms for computing Liouvillian solutions for the important problem of linear ODEs with rational coefficients. Taking as sample the 363 secon...
L. Chan, E. S. Cheb-Terrab
PARA
2004
Springer
14 years 1 months ago
A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...
Abbas Edalat, Dirk Pattinson