Sciweavers

2693 search results - page 242 / 539
» On Computing Complex Navigation Functions
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
PODC
2004
ACM
16 years 1 days ago
Signed quorum systems
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
Haifeng Yu
ECAI
2004
Springer
16 years 16 hour ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
HICSS
2005
IEEE
165views Biometrics» more  HICSS 2005»
16 years 7 days ago
A Study of Project Management System Acceptance
This study surveyed 497 project management software users in a wide variety of project-driven organizations to examine the relationships among: computer self-efficacy, information...
Abdullah Saeed Bani Ali, William H. Money
MP
2008
135views more  MP 2008»
15 years 6 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye