Sciweavers

4935 search results - page 753 / 987
» An Adaptive Supersampling Method
Sort
View
137
Voted
MMB
2010
Springer
185views Communications» more  MMB 2010»
15 years 5 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
116
Voted
CIKM
2008
Springer
15 years 5 months ago
Using the current browsing context to improve search relevance
In this paper, we investigate the problem of improving the relevance of a Web search engine by adapting it to the dynamic needs of the user. We examine a representative case of su...
Mandar Rahurkar, Silviu Cucerzan
115
Voted
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
15 years 5 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
150
Voted
ICPW
2007
15 years 5 months ago
Rule responder: RuleML-based agents for distributed collaboration on the pragmatic web
The Rule Responder project (responder.ruleml.org) extends the Semantic Web towards a Pragmatic Web infrastructure for collaborative human-computer networks. These allow semi-autom...
Adrian Paschke, Harold Boley, Alexander Kozlenkov,...
126
Voted
FPL
2008
Springer
110views Hardware» more  FPL 2008»
15 years 5 months ago
Automatic generation of run-time parameterizable configurations
In many applications, subsequent data manipulations differ only in a small set of parameter values. Because of their reconfigurability, FPGAs (Field Programmable Gate Arrays) can ...
Karel Bruneel, Dirk Stroobandt