Sciweavers

580 search results - page 95 / 116
» On the Foundations of Answer Set Programming
Sort
View
IJKSR
2011
106views more  IJKSR 2011»
13 years 23 hour ago
Integrating the LMS in Service Oriented eLearning Systems
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
José Paulo Leal, Ricardo Queirós
WCRE
2006
IEEE
14 years 2 months ago
Extracting Output Formats from Executables
We describe the design and implementation of FFE/x86 (File-Format Extractor for x86), an analysis tool that works on stripped executables (i.e., neither source code nor debugging ...
Junghee Lim, Thomas W. Reps, Ben Liblit
ICALP
1998
Springer
14 years 25 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 8 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
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
14 years 5 days ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer