Sciweavers

705 search results - page 111 / 141
» New Compilation Languages Based on Structured Decomposabilit...
Sort
View
AIPS
2009
14 years 11 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
TASLP
2008
201views more  TASLP 2008»
14 years 9 months ago
Syntactically Lexicalized Phrase-Based SMT
Abstract--Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic knowledge caused system performance to deteriorate. The most recent su...
Hany Hassan, Khalil Sima'an, Andy Way
VL
2009
IEEE
150views Visual Languages» more  VL 2009»
15 years 4 months ago
Discovery-based edit assistance for spreadsheets
Spreadsheets can be viewed as a highly flexible endusers programming environment which enjoys wide-spread adoption. But spreadsheets lack many of the structured programming conce...
Jácome Cunha, João Saraiva, Joost Vi...
WWW
2008
ACM
15 years 10 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
QEST
2008
IEEE
15 years 4 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...