1209 search results - page 204 / 242 » Universal Algebra and Computer Science |
124
click to vote
FOCS
2009
IEEE
15 years 9 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...
112
Voted
FOCS
2007
IEEE
15 years 8 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...
118
click to vote
SENSYS
2005
ACM
15 years 8 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...
135
click to vote
ISD
1999
Springer
15 years 6 months 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...
111
Voted
WSC
2004
15 years 3 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...