1209 search results - page 204 / 242 » Universal Algebra and Computer Science |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
SENSYS
2005
ACM
14 years 2 months ago
2005
ACM
ng Link Abstraction for Wireless Sensor Networks Joseph Polastre, Jonathan Hui, Philip Levis, Jerry Zhao, David Culler, Scott Shenker, and Ion Stoica Computer Science Department In...
ISD
1999
Springer
14 years 28 days ago
1999
Springer
This paper describes an ongoing collaborative research program between the Computer Science and the Forestry and Wildlife Management Departments at the University of Massachusetts...
WSC
2004
13 years 10 months ago
2004
This paper describes the application of data farming techniques (Brandstein and Horne 1998) to explore various aspects of coevolutionary dynamics (McKelvey 2002) in organization s...