19130 search results - page 108 / 3826 » Modelling multi-path problems |
136
click to vote
IEEEHPCS
2010
15 years 4 months ago
2010
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
169
click to vote
CPAIOR
2007
Springer
16 years 15 days ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
147
click to vote
ITS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper, we use supervised machine learning to automatically identify the problem localization of peer-review feedback. Using five features extracted via Natural L...
129
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: The purpose of this report is to present the Crossdock Door Assignment Problem, which involves assigning destinations to outbound dock doors of Crossdock centres such that travel...
158
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...