6607 search results - page 698 / 1322 » Making TeX Work |
201
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
219
click to vote
COMPSEC
2008
15 years 7 months ago
2008
Short Message Service is usually used to transport unclassified information, but with the rise of mobile commerce it has become an integral tool for conducting business. However S...
176
click to vote
COR
2008
15 years 7 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
218
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
- Nowadays computing becomes increasingly mobile and pervasive. One of the important steps in pervasive computing is context-awareness. Context-aware pervasive systems rely on info...
158
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract--This paper proposes a method for deriving formal specifications of systems. To accomplish this task we pass through a non trivial number of steps, concepts and tools wher...