default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmílio C. G. Wille
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Marcos Talau, Thiago A. Herek, Mauro Fonseca
, Emílio C. G. Wille:
Improving TCP performance over a common IoT scenario using the Early Window Tailoring method. Comput. Networks 234: 109875 (2023)- [j15]Danilo Renato de Assis, Joilson Alves Junior, Emílio Carlos Gomes Wille:
Strategies to increase connectivity and performance of VANETs: Analysis of route lifetime and routing protocol proposal. Trans. Emerg. Telecommun. Technol. 34(1) (2023) - [j14]Emílio Carlos Gomes Wille:
Simple and Accurate Approximations for the Sum of Nakagami-m and Related Random Variables. Int. J. Wirel. Inf. Networks 30(4): 348-355 (2023) - 2022
- [j13]Danilo Renato de Assis, Joilson Alves Junior, Emílio Carlos Gomes Wille:
An Analysis of Route Duration Times in Vehicular Networks Considering Influential Factors. J. Inf. Technol. Res. 15(1): 1-16 (2022) - 2020
- [j12]Clovis Ronaldo da Costa Bento, Emílio Carlos Gomes Wille:
Bio-inspired routing algorithm for MANETs based on fungi networks. Ad Hoc Networks 107: 102248 (2020)
2010 – 2019
- 2019
- [j11]Marcos Talau, Mauro Fonseca, Emílio C. G. Wille:
Early Window Tailoring: A New Approach to Increase the Number of TCP Connections Served. J. Comput. Networks Commun. 2019: 2187543:1-2187543:12 (2019) - 2018
- [j10]Joilson Alves Junior, Emílio C. G. Wille:
Routing in Vehicular Ad Hoc Networks: Main Characteristics and Tendencies. J. Comput. Networks Commun. 2018: 1302123:1-1302123:10 (2018) - [j9]Dyson Pereira Junior, Emílio Carlos Gomes Wille:
FB-APSP: A new efficient algorithm for computing all-pairs shortest-paths. J. Netw. Comput. Appl. 121: 33-43 (2018) - 2016
- [j8]Joilson Alves Junior, Emílio Carlos Gomes Wille:
P-AOMDV: An improved routing protocol for V2V communication based on public transport backbones. Trans. Emerg. Telecommun. Technol. 27(12): 1653-1663 (2016) - [j7]Emílio C. G. Wille, Hermes Irineu Del Monego, Bruno V. Coutinho, Giovanna G. Basilio:
Routing Protocols for VANETs: An Approach based on Genetic Algorithms. KSII Trans. Internet Inf. Syst. 10(2): 542-558 (2016) - [c10]Marcos Talau, Mauro Fonseca, Anelise Munaretto, Emílio Carlos Gomes Wille:
Early congestion control: A new approach to improve the performance of TCP in ad hoc networks. NOF 2016: 1-6 - 2015
- [j6]Joilson Alves Junior, Emílio Carlos Gomes Wille:
Improving VANETs Connectivity with a Totally Ad Hoc Living Mobile Backbone. J. Comput. Networks Commun. 2015: 273031:1-273031:14 (2015) - [c9]Bruno V. Coutinho, Emílio C. G. Wille, Hermes Irineu Del Monego:
Performance of routing protocols for VANETs: a realistic analysis format. IMCOM 2015: 1:1-1:6 - 2013
- [c8]Marcos Talau, Emílio Carlos Gomes Wille, Heitor Silvério Lopes:
Solving the base station placement problem by means of swarm intelligence. CIComms 2013: 39-44 - 2012
- [i1]Fernando Barreto, Emílio C. G. Wille, Luiz Nacamura Jr.:
Fast emergency paths schema to overcome transient link failures in ospf routing. CoRR abs/1204.2465 (2012) - 2011
- [j5]Emílio Carlos Gomes Wille, Eduardo Yabcznski, Heitor Silvério Lopes:
Discrete Capacity Assignment in IP networks using Particle Swarm Optimization. Appl. Math. Comput. 217(12): 5338-5346 (2011)
2000 – 2009
- 2008
- [c7]Fernando Barreto, Emílio C. G. Wille, Luiz Nacamura Jr.:
Fast Recovery Paths: Reducing Packet Loss Rates during IP Routing Convergence. AICT 2008: 101-110 - [c6]Fernando Barreto, Emílio C. G. Wille, Luiz Nacamura:
A Fast Rerouting Approach to Reduce Packet Loss during IP Routing Protocols Convergence. AINA 2008: 675-682 - [c5]Kleber Kendy Horikawa Nabas, Walter Godoy Jr., Emílio C. G. Wille:
A Simulation Study of the WFQ Scheduler in a DiffServ Node under LRD Traffic. ICN 2008: 385-391 - [c4]Fernando Barreto, Emílio C. G. Wille, Luiz Nacamura:
Fast recovery paths schema to improve reliability in IP networks. NOMS 2008: 698-701 - 2006
- [j4]Emílio C. G. Wille, Marco Mellia, Emilio Leonardi, Marco Ajmone Marsan:
Algorithms for IP network design with end-to-end QoS constraints. Comput. Networks 50(8): 1086-1103 (2006) - [c3]Walter Godoy Jr., Emílio C. G. Wille:
A Simple Acceptance Criterion for Binary Block Codes Soft-Decision Algorithms. AICT/ICIW 2006: 53 - 2005
- [c2]Emílio C. G. Wille, Marco Mellia, Emilio Leonardi, Marco Ajmone Marsan:
Topological Design of Survivable IP Networks Using Metaheuristic Approaches. QoS-IP 2005: 191-206 - 2004
- [b1]Emílio Carlos Gomes Wille:
Design and planning of IP networks under end-to-end QoS constraints. Polytechnic University of Turin, Italy, 2004 - 2001
- [j3]Emílio C. G. Wille, Walter Godoy Jr.:
Multilevel coding modulation system with binary block codes. Comput. Commun. 24(3-4): 292-295 (2001) - [c1]Walter Godoy Jr., Emílio C. G. Wille:
Analysis of a Bound of Voronoi Region V(C0) and Proposal of Sub-Optimum Decoding Algorithm. ITCC 2001: 690-
1990 – 1999
- 1998
- [j2]Walter Godoy Jr., Emílio C. G. Wille:
Proposal of sub-optimum decoding algorithm with a bound of Voronoi region V(C0). Comput. Commun. 21(8): 736-740 (1998) - 1997
- [j1]Dulte J. de Barros, Walter Godoy Jr., Emílio C. G. Wille:
A new approach to the information set decoding algorithm. Comput. Commun. 20(4): 302-308 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
