Sciweavers

10493 search results - page 1843 / 2099
» Dynamic Word Problems
Sort
View
CP
2006
Springer
15 years 6 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
CAMAD
2006
IEEE
15 years 6 months ago
Improving quality of service for switched processing systems
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...
Ying-Chao Hung, George Michailidis
DAWAK
2006
Springer
15 years 6 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin
124
Voted
DCOSS
2006
Springer
15 years 6 months ago
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
Aubin Jarry, Pierre Leone, Olivier Powell, Jos&eac...
DMSN
2006
ACM
15 years 6 months ago
Processing proximity queries in sensor networks
Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we in...
Yannis Kotidis
« Prev « First page 1843 / 2099 Last » Next »