Sciweavers

1450 search results - page 122 / 290
» On the Complexity of Hardness Amplification
Sort
View
CCR
2010
151views more  CCR 2010»
13 years 6 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...
CORR
2011
Springer
339views Education» more  CORR 2011»
13 years 4 months ago
Context Capture in Software Development
The context of a software developer is something hard to define and capture, as it represents a complex network of elements across different dimensions that are not limited to th...
Bruno Antunes, Francisco Correia, Paulo Gomes
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 4 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
MAGS
2010
81views more  MAGS 2010»
13 years 4 months ago
Task allocation learning in a multiagent environment: Application to the RoboCupRescue simulation
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
Sébastien Paquet, Brahim Chaib-draa, Patric...
ICASSP
2011
IEEE
13 years 27 days ago
EM-style optimization of hidden conditional random fields for grapheme-to-phoneme conversion
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ...
Georg Heigold, Stefan Hahn, Patrick Lehnen, Herman...