Sciweavers

1433 search results - page 64 / 287
» On Covering Problems of Rado
Sort
View
CCCG
2007
15 years 1 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
COCOON
2005
Springer
15 years 5 months ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
CORR
2008
Springer
81views Education» more  CORR 2008»
14 years 12 months ago
Revisiting the Core Ontology and Problem in Requirements Engineering
In their seminal paper in the ACM Transactions on Software Engineering and Methodology, Zave and Jackson established a core ontology for Requirements Engineering (RE) and used it ...
Ivan Jureta, John Mylopoulos, Stéphane Faul...
DIMEA
2008
122views Multimedia» more  DIMEA 2008»
15 years 1 months ago
Multiplayer role games applied to problem based learning
The educational community is willing to approach the learning applications to the engaging and immersive formats of multimedia and video games as a way of increasing the motivatio...
Pilar Sancho, Pedro Pablo Gómez-Martí...
ICFEM
2000
Springer
15 years 3 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai