Sciweavers

16091 search results - page 119 / 3219
» Solving
Sort
View
131
Voted
EMNLP
2010
15 years 13 days ago
Evaluating the Impact of Alternative Dependency Graph Encodings on Solving Event Extraction Tasks
In state-of-the-art approaches to information extraction (IE), dependency graphs constitute the fundamental data structure for syntactic structuring and subsequent knowledge elici...
Ekaterina Buyko, Udo Hahn
IPPS
2010
IEEE
15 years 10 days ago
Solving the advection PDE on the cell broadband engine
In this paper we present the venture of porting two different algorithms for solving the two-dimensional advection PDE on the CBE platform, an in-place and an outof-place one, and ...
Georgios Rokos, Gerassimos Peteinatos, Georgia Kou...
ICTAI
2009
IEEE
15 years 4 days ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
14 years 12 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
14 years 12 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...