8512 search results - page 420 / 1703 » Computing Theory With Relevance |
278
click to vote
Lecture Notes
"This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive, with just enough theory thrown in to make you nervous. I assume you know C...
204
click to vote
Presentation
This presentation was given as part of theory seminars @ Dept of CSA, Indian Institute of Science, Bangalore. This talk explains about assignment problem and why mechanism design i...
131
click to vote
KBS
2006
15 years 6 months ago
2006
Dialogic argumentation is a crucial component in many computational domains, and forms a core component of argumentation theory. This paper compares two approaches to dialogue tha...
195
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
198
click to vote
RTA
1997
Springer
15 years 11 months ago
1997
Springer
A prototypical framework, which was used for building software components for symbolic computation, is extended as follows. First, we demonstrate that the server components can be ...