Sciweavers

716 search results - page 79 / 144
» Rule Formats for Timed Processes
Sort
View
AAMAS
2012
Springer
12 years 3 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
EMNLP
2010
13 years 5 months ago
SCFG Decoding Without Binarization
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
Mark Hopkins, Greg Langmead
COMCOM
2008
99views more  COMCOM 2008»
13 years 7 months ago
Efficiently reconfigurable backbones for wireless sensor networks
We present the definition and performance evaluation of a protocol for building and maintaining a connected backbone among the nodes of a wireless sensor networks (WSN). Building ...
Stefano Basagni, Chiara Petrioli, Roberto Petrocci...
DAWAK
2000
Springer
14 years 1 days ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
MOR
2006
79views more  MOR 2006»
13 years 7 months ago
Poisson Disorder Problem with Exponential Penalty for Delay
Abstract. We solve the Poisson disorder problem when the delay is penalized exponentially. Our objective is to detect as quickly as possible the unobservable time of the change (or...
Erhan Bayraktar, Savas Dayanik