10891 search results - page 1521 / 2179 » Combining Model Reductions |
205
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
205
Voted
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
140
click to vote
ACSAC
2008
IEEE
16 years 1 months ago
2008
IEEE
We present and evaluate various methods for purely automated attacks against click-based graphical passwords. Our purely automated methods combine click-order heuristics with focu...
193
Voted
AINA
2008
IEEE
16 years 1 months ago
2008
IEEE
—This work tries to derive ideas for thread allocation in Chip Multiprocessor (CMP)-based network processors performing general applications by Continuous-Time Markov Chain model...
202
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper considers a network composed of robotic agents and static nodes performing spatial estimation of a dynamic physical processes. The physical process is modeled as a s...