Sciweavers

3918 search results - page 485 / 784
» Probabilistic model of triangulation
Sort
View
SPAA
2009
ACM
16 years 7 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
PODC
2004
ACM
16 years 3 days ago
On the design of distributed protocols from differential equations
We propose a framework to translate certain subclasses of differential equation systems into distributed protocols that are practical. The synthesized protocols are state machine...
Indranil Gupta
AIPS
2008
15 years 9 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 10 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu