Sciweavers

1259 search results - page 2 / 252
» In search of the memoryless property
Sort
View
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 10 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 10 months ago
Outer Bounds for Multiple Access Channels with Feedback using Dependence Balance
We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple-access channel with noiseless feedback (MAC-FB). We co...
Ravi Tandon, Sennur Ulukus
PERCOM
2007
ACM
14 years 10 months ago
Energy-Aware Tag Anti-Collision Protocols for RFID Systems
Energy consumption of mobile readers is becoming an important issue as applications of RFID systems pervade different aspects of our lives. Surprisingly, however, these systems ar...
Vinod Namboodiri, Lixin Gao
IANDC
2008
85views more  IANDC 2008»
13 years 10 months ago
Monotony properties of connected visible graph searching
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
Pierre Fraigniaud, Nicolas Nisse
APN
2005
Springer
14 years 4 months ago
The (True) Concurrent Markov Property and Some Applications to Markov Nets
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...
Samy Abbes