Sciweavers

1568 search results - page 12 / 314
» The problem of examination questions in algorithmics
Sort
View
ACL
2009
13 years 5 months ago
Answering Opinion Questions with Random Walks on Graphs
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
Fangtao Li, Yang Tang, Minlie Huang, Xiaoyan Zhu
INFORMS
2008
55views more  INFORMS 2008»
13 years 7 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
IPPS
2009
IEEE
14 years 2 months ago
A fusion-based approach for tolerating faults in finite state machines
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
Vinit A. Ogale, Bharath Balasubramanian, Vijay K. ...
ICDE
2012
IEEE
249views Database» more  ICDE 2012»
11 years 9 months ago
Answering Why-not Questions on Top-k Queries
Abstract—After decades of effort working on database performance, the quality and the usability of database systems have received more attention in recent years. In particular, t...
Zhian He, Eric Lo
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
13 years 11 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng