Sciweavers

117 search results - page 11 / 24
» What do we know about the Metropolis algorithm
Sort
View
EJC
2007
13 years 7 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
NIPS
2004
13 years 8 months ago
Heuristics for Ordering Cue Search in Decision Making
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
Peter M. Todd, Anja Dieckmann
ITRUST
2005
Springer
14 years 28 days ago
Interactive Credential Negotiation for Stateful Business Processes
Business Processes for Web Services are the new paradigm for lightweight enterprise integration. They cross organizational boundaries, are provided by entities that see each other ...
Hristo Koshutanski, Fabio Massacci
UM
2010
Springer
14 years 14 days ago
Analyzing Community Knowledge Sharing Behavior
The effectiveness of support provided to virtual communities depends strongly on what we know about a particular community of people and in what areas the community needs support....
Styliani Kleanthous, Vania Dimitrova
AGENTS
2001
Springer
13 years 12 months ago
The intelligent classroom: providing competent assistance
In the software industry, designers are forever trying to “improve” their products by adding ever more features to them, producing bloated software systems that are capable of...
David Franklin, Kristian J. Hammond