1871 search results - page 41 / 375 » The Ephemeral Pairing Problem |
90
Voted
DAM
2008
14 years 11 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
— This article addresses the invertibility problem for switched nonlinear systems affine in controls. The problem is concerned with finding the input and switching signal uniqu...
NIPS
2000
15 years 14 days ago
2000
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
ICC
2009
IEEE
15 years 5 months ago
2009
IEEE
—We consider a multi-access two-way relay network where multiple pairs of users exchange information with their pre-assigned partners with the assistance of an intermediate relay...
ESWA
2007
14 years 11 months ago
2007
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...