Sciweavers

6306 search results - page 240 / 1262
» Space, Time, and the Use of Language
Sort
View
INFOCOM
2008
IEEE
15 years 5 months ago
HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
75
Voted
ECP
1997
Springer
103views Robotics» more  ECP 1997»
15 years 3 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
POPL
1995
ACM
15 years 2 months ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
CIKM
2011
Springer
13 years 11 months ago
An efficient method for using machine translation technologies in cross-language patent search
Topics in prior-art patent search are typically full patent applications and relevant items are patents often taken from sources in different languages. Cross language patent retr...
Walid Magdy, Gareth J. F. Jones
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 1 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo