Sciweavers

4074 search results - page 642 / 815
» Defining Computational Aesthetics
Sort
View
COMMA
2008
15 years 5 months ago
Semantics for Evidence-Based Argumentation
Abstract. The identification of consistent sets of arguments is one of the most important concerns in the development of computational models of argument. Such extensions drive the...
Nir Oren, Timothy J. Norman
DAGSTUHL
2008
15 years 5 months ago
Complete Interval Arithmetic and its Implementation
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
Ulrich W. Kulisch
LREC
2010
133views Education» more  LREC 2010»
15 years 5 months ago
Towards a Learning Approach for Abbreviation Detection and Resolution
The explosion of biomedical literature and with it the -uncontrolled- creation of abbreviations presents some special challenges for both human readers and computer applications. ...
Klaar Vanopstal, Bart Desmet, Véronique Hos...
ICWS
2008
IEEE
15 years 5 months ago
Dynamic Availability Estimation for Service Selection Based on Status Identification
With the popularity of Service-Oriented Computing, how to construct highly available service-oriented applications is becoming a hot topic in both the research and industry commun...
Lingshuang Shao, Lu Zhang, Tao Xie, Junfeng Zhao, ...
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 5 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...