Sciweavers

1557 search results - page 65 / 312
» What can we do with a Solution
Sort
View
SIGMOD
2002
ACM
181views Database» more  SIGMOD 2002»
14 years 7 months ago
Archiving scientific data
This report is part of the seminar Digital Information Curation held by Prof. Dr. Marc H. Scholl and Dr. Andr?e Seifert during the winter term 2005/06. Its intention is to summari...
Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang...
CEAS
2005
Springer
14 years 1 months ago
The Social Network and Relationship Finder: Social Sorting for Email Triage
Email triage is the process of going through unhandled email and deciding what to do with it. This process can quickly become a serious problem for users with large volumes of ema...
Carman Neustaedter, A. J. Bernheim Brush, Marc A. ...
CP
2011
Springer
12 years 7 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
14 years 1 months ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy
NIPS
2003
13 years 9 months ago
Approximate Planning in POMDPs with Macro-Actions
Recent research has demonstrated that useful POMDP solutions do not require consideration of the entire belief space. We extend this idea with the notion of temporal abstraction. ...
Georgios Theocharous, Leslie Pack Kaelbling