Sciweavers

577 search results - page 97 / 116
» Computing Rational Bisectors
Sort
View
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 7 days ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
SIGECOM
2000
ACM
175views ECommerce» more  SIGECOM 2000»
14 years 4 days ago
Competitive analysis of incentive compatible on-line auctions
This paper studies auctions in a setting where the di erent bidders arrive at di erent times and the auction mechanism is required to make decisions about each bid as it is receiv...
Ron Lavi, Noam Nisan
ATAL
1999
Springer
14 years 2 days ago
Variable Sociability in Agent-Based Decision Making
Multi-agent system research is concerned with the issues surrounding the performance of collections of interacting agents. A major concern, therefore, is with the design of the dec...
Lisa Hogg, Nicholas R. Jennings
ISIPTA
1999
IEEE
108views Mathematics» more  ISIPTA 1999»
14 years 2 days ago
Coherent Models for Discrete Possibilistic Systems
We consider discrete possibilistic systems for which the available information is given by one-step transition possibilities and initial possibilities. These systems can be repres...
Hugo J. Janssen, Gert De Cooman, Etienne E. Kerre
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
13 years 11 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate