Sciweavers

10304 search results - page 2035 / 2061
» Computer science with the sciences: an emphasis in computati...
Sort
View
ADHOC
2010
292views more  ADHOC 2010»
14 years 9 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
AI
2010
Springer
14 years 9 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
AI
2008
Springer
14 years 9 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
AROBOTS
2010
180views more  AROBOTS 2010»
14 years 9 months ago
Reactive direction control for a mobile robot: a locust-like control of escape direction emerges when a bilateral pair of model
Locusts possess a bilateral pair of uniquely identifiable visual neurons that respond vigorously to the image of an approaching object. These neurons are called the lobula giant m...
Shigang Yue, Roger D. Santer, Yoshifumi Yamawaki, ...
APPML
2007
101views more  APPML 2007»
14 years 9 months ago
Extension of a theorem of Whitney
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Paul C. Kainen, Shannon Overbay
« Prev « First page 2035 / 2061 Last » Next »