Sciweavers

740 search results - page 106 / 148
» Open Answer Set Programming with Guarded Programs
Sort
View
ICALP
1998
Springer
14 years 5 days ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
JWSR
2007
83views more  JWSR 2007»
13 years 7 months ago
Web Service Discovery and Composition for Virtual Enterprises
: One main characteristic of virtual enterprises are short-term collaborations between business partners to provide efficient and individualized services to customers. The MOVE pro...
Jürgen Dorn, Peter Hrastnik, Albert Rainer
STACS
2010
Springer
14 years 2 months ago
Dispersion in Unit Disks
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
Adrian Dumitrescu, Minghui Jiang
WCRE
2008
IEEE
14 years 2 months ago
Reverse Engineering CAPTCHAs
CAPTCHAs are automated Turing tests used to determine if the end-user is human and not an automated program. Users are asked to read and answer Visual CAPTCHAs, which often appear...
Abram Hindle, Michael W. Godfrey, Richard C. Holt
SAC
2000
ACM
14 years 10 days ago
A Mobile Agent Infrastructure for the Mobility Support
The mobility of terminals and users is a crucial issue in the open global system represented by the Internet. Supporting terminal and user mobility requires a middleware infrastru...
Paolo Bellavista, Antonio Corradi, Cesare Stefanel...